Sciweavers

Share
ICCV
2005
IEEE

Neighborhood Preserving Embedding

10 years 1 months ago
Neighborhood Preserving Embedding
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling a probability distribution that has support on or near a submanifold of Euclidean space. In this paper, we propose a novel subspace learning algorithm called Neighborhood Preserving Embedding (NPE). Different from Principal Component Analysis (PCA) which aims at preserving the global Euclidean structure, NPE aims at preserving the local neighborhood structure on the data manifold. Therefore, NPE is less sensitive to outliers than PCA. Also, comparing to the recently proposed manifold learning algorithms such as Isomap and Locally Linear Embedding, NPE is defined everywhere, rather than only on the training data points. Furthermore, NPE may be conducted in the original space or in the reproducing kernel Hilbert space into which data points are mapped. This gives rise to kernel NPE. Several experiments on face...
Xiaofei He, Deng Cai, Shuicheng Yan, HongJiang Zha
Added 15 Oct 2009
Updated 30 Oct 2009
Type Conference
Year 2005
Where ICCV
Authors Xiaofei He, Deng Cai, Shuicheng Yan, HongJiang Zhang
Comments (0)
books