Sciweavers

1224 search results - page 7 / 245
» On the Optimality of the Dimensionality Reduction Method
Sort
View
ICIP
2005
IEEE
15 years 11 months ago
Nonlinear dimensionality reduction for classification using kernel weighted subspace method
We study the use of kernel subspace methods that learn low-dimensional subspace representations for classification tasks. In particular, we propose a new method called kernel weigh...
Guang Dai, Dit-Yan Yeung
68
Voted
IMR
2003
Springer
15 years 2 months ago
Generalization of the Kantorovich Method of Dimensional Reduction
Ralf Sondershaus, Stefan Gumhold
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
15 years 10 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
BMCBI
2010
224views more  BMCBI 2010»
14 years 9 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta
PODS
2001
ACM
190views Database» more  PODS 2001»
15 years 9 months ago
On the Effects of Dimensionality Reduction on High Dimensional Similarity Search
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
Charu C. Aggarwal