Sciweavers

184 search results - page 6 / 37
» Efficiently handling feature redundancy in high-dimensional ...
Sort
View
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
14 years 9 months ago
Querying Complex Spatio-Temporal Sequences in Human Motion Databases
Content-based retrieval of spatio-temporal patterns from human motion databases is inherently nontrivial since finding effective distance measures for such data is difficult. These...
Yueguo Chen, Shouxu Jiang, Beng Chin Ooi, Anthony ...
ICAPR
2001
Springer
14 years 5 days ago
Image Retrieval Using a Hierarchy of Clusters
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
Daniela Stan, Ishwar K. Sethi
AAAI
2010
13 years 9 months ago
Efficient Spectral Feature Selection with Minimum Redundancy
Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and uns...
Zheng Zhao, Lei Wang, Huan Liu
IWANN
2005
Springer
14 years 1 months ago
Heuristic Search over a Ranking for Feature Selection
In this work, we suggest a new feature selection technique that lets us use the wrapper approach for finding a well suited feature set for distinguishing experiment classes in hig...
Roberto Ruiz, José Cristóbal Riquelm...
EPIA
2005
Springer
14 years 1 months ago
An Extension of Self-organizing Maps to Categorical Data
Self-organizing maps (SOM) have been recognized as a powerful tool in data exploratoration, especially for the tasks of clustering on high dimensional data. However, clustering on ...
Ning Chen, Nuno C. Marques