Locally linear embedding is often invalid for sparse data sets because locally linear embedding simply takes the reconstruction weights obtained from the data space as the weights of the embedding space. This paper proposes an improved local linear embedding for sparse data sets. In the proposed method, the neighborhood correlation matrix presenting the position information of the points constructed from the embedding space is added to the correlation matrix in the original space, thus the reconstruction weights can be adjusted. As the reconstruction weights adjusted gradually, the position information of sparse points can also be changed continually and the local geometry of the data manifolds in the embedding space can be well preserved. Experimental results on both synthetic and real-world data show that the proposed approach is very robust against sparse data sets.
[1]
Dit-Yan Yeung,et al.
Robust locally linear embedding
,
2006,
Pattern Recognit..
[2]
Matthew Brand,et al.
Charting a Manifold
,
2002,
NIPS.
[3]
Charles R. Johnson,et al.
Matrix analysis
,
1985,
Statistical Inference for Engineers and Data Scientists.
[4]
J. Tenenbaum,et al.
A global geometric framework for nonlinear dimensionality reduction.
,
2000,
Science.
[5]
Matti Pietikäinen,et al.
Incremental locally linear embedding
,
2005,
Pattern Recognit..
[6]
S T Roweis,et al.
Nonlinear dimensionality reduction by locally linear embedding.
,
2000,
Science.