Sciweavers

79 search results - page 1 / 16
» Automatic configuration of spectral dimensionality reduction...
Sort
View
PRL
2010
130views more  PRL 2010»
13 years 6 months ago
Automatic configuration of spectral dimensionality reduction methods
In this paper, our main contribution is a framework for the automatic configuration of any spectral dimensionality reduction methods. This is achieved, first, by introducing the m...
Michal Lewandowski, Dimitrios Makris, Jean-Christo...
PKDD
2004
Springer
116views Data Mining» more  PKDD 2004»
14 years 27 days ago
Random Matrices in Data Analysis
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
Dimitris Achlioptas
ICML
2005
IEEE
14 years 8 months ago
Analysis and extension of spectral methods for nonlinear dimensionality reduction
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
Fei Sha, Lawrence K. Saul
ICML
2006
IEEE
14 years 8 months ago
A duality view of spectral methods for dimensionality reduction
We present a unified duality view of several recently emerged spectral methods for nonlinear dimensionality reduction, including Isomap, locally linear embedding, Laplacian eigenm...
Lin Xiao, Jun Sun 0003, Stephen P. Boyd
ICML
2007
IEEE
14 years 8 months ago
Robust non-linear dimensionality reduction using successive 1-dimensional Laplacian Eigenmaps
Non-linear dimensionality reduction of noisy data is a challenging problem encountered in a variety of data analysis applications. Recent results in the literature show that spect...
Samuel Gerber, Tolga Tasdizen, Ross T. Whitaker