Sciweavers

99 search results - page 1 / 20
» Analysis and extension of spectral methods for nonlinear dim...
Sort
View
ICML
2005
IEEE
14 years 5 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
BMCBI
2005
120views more  BMCBI 2005»
13 years 4 months ago
SpectralNET - an application for spectral graph analysis and visualization
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
Joshua J. Forman, Paul A. Clemons, Stuart L. Schre...
ICML
2007
IEEE
14 years 5 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
ICML
2010
IEEE
13 years 6 months ago
The Elastic Embedding Algorithm for Dimensionality Reduction
We propose a new dimensionality reduction method, the elastic embedding (EE), that optimises an intuitive, nonlinear objective function of the low-dimensional coordinates of the d...
Miguel Á. Carreira-Perpiñán
PKDD
2004
Springer
116views Data Mining» more  PKDD 2004»
13 years 10 months 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