Sciweavers

5092 search results - page 195 / 1019
» Clustering the Feature Space
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 8 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
CVPR
2012
IEEE
13 years 9 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...
191
Voted
ICPR
2000
IEEE
15 years 10 months ago
Color Texture Classification by Normalized Color Space Representation
This paper proposes a novel approach to color texture characterization and classification. Rather than developing new textural features, we propose to derive a family of new, redu...
Constantin Vertan, Nozha Boujemaa
BMCBI
2006
140views more  BMCBI 2006»
15 years 7 months ago
Feature selection using Haar wavelet power spectrum
Background: Feature selection is an approach to overcome the 'curse of dimensionality' in complex researches like disease classification using microarrays. Statistical m...
Prabakaran Subramani, Rajendra Sahu, Shekhar Verma
BMCBI
2006
97views more  BMCBI 2006»
15 years 7 months ago
REEF: searching REgionally Enriched Features in genomes
Background: In Eukaryotic genomes, different features including genes are not uniformly distributed. The integration of annotation information and genomic position of functional D...
Alessandro Coppe, Gian Antonio Danieli, Stefania B...