Sciweavers

3006 search results - page 94 / 602
» Dimensionality reduction and generalization
Sort
View
ESANN
2007
13 years 11 months ago
Estimation of tangent planes for neighborhood graph correction
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
Karina Zapien Arreola, Gilles Gasso, Stépha...
IJCAI
2007
13 years 11 months ago
Improving Embeddings by Flexible Exploitation of Side Information
Dimensionality reduction is a much-studied task in machine learning in which high-dimensional data is mapped, possibly via a non-linear transformation, onto a low-dimensional mani...
Ali Ghodsi, Dana F. Wilkinson, Finnegan Southey
NIPS
2004
13 years 11 months ago
Kernel Projection Machine: a New Tool for Pattern Recognition
This paper investigates the effect of Kernel Principal Component Analysis (KPCA) within the classification framework, essentially the regularization properties of this dimensional...
Laurent Zwald, Régis Vert, Gilles Blanchard...
NIPS
1997
13 years 11 months ago
Mapping a Manifold of Perceptual Observations
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
Joshua B. Tenenbaum
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 8 months ago
Random Projections for $k$-means Clustering
This paper discusses the topic of dimensionality reduction for k-means clustering. We prove that any set of n points in d dimensions (rows in a matrix A ∈ Rn×d ) can be project...
Christos Boutsidis, Anastasios Zouzias, Petros Dri...