Sciweavers

117 search results - page 4 / 24
» Dimension Reduction for Supervised Ordering
Sort
View
TSMC
2010
13 years 2 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
14 years 4 months ago
Hierarchical Linear Discriminant Analysis for Beamforming.
This paper demonstrates the applicability of the recently proposed supervised dimension reduction, hierarchical linear discriminant analysis (h-LDA) to a well-known spatial locali...
Barry L. Drake, Haesun Park, Jaegul Choo
SAC
2006
ACM
14 years 1 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 7 months ago
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
Ping Li
JMLR
2008
131views more  JMLR 2008»
13 years 7 months ago
On Relevant Dimensions in Kernel Feature Spaces
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
Mikio L. Braun, Joachim M. Buhmann, Klaus-Robert M...