Sciweavers

5 search results - page 1 / 1
» Deflating the Dimensionality Curse Using Multiple Fractal Di...
Sort
View
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 5 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
CVPR
2005
IEEE
14 years 6 months ago
Concurrent Subspaces Analysis
A representative subspace is significant for image analysis, while the corresponding techniques often suffer from the curse of dimensionality dilemma. In this paper, we propose a ...
Dong Xu, Shuicheng Yan, Lei Zhang, HongJiang Zhang...
IJISTA
2008
95views more  IJISTA 2008»
13 years 4 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach
FGR
2006
IEEE
162views Biometrics» more  FGR 2006»
13 years 8 months ago
Hierarchical Ensemble of Gabor Fisher Classifier for Face Recognition
Gabor feature has been widely recognized as one of the best representations for face recognition. However, traditionally, it has to be reduced in dimension due to curse of dimensi...
Yu Su, Shiguang Shan, Xilin Chen, Wen Gao
GRC
2010
IEEE
13 years 5 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi