An improved locally linear embedding for sparse data sets

Ying Wen*, Lianghua He

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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 method for sparse data sets, a united locally linear embedding, to make the reconstruction more robust to 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.

Original languageEnglish
Pages (from-to)763-775
Number of pages13
JournalInternational Journal of Pattern Recognition and Artificial Intelligence
Volume25
Issue number5
DOIs
StatePublished - Aug 2011

Keywords

  • Locally linear embedding
  • feature extraction
  • manifold learning
  • pattern recognition

Fingerprint

Dive into the research topics of 'An improved locally linear embedding for sparse data sets'. Together they form a unique fingerprint.

Cite this