Local linear embedding algorithm based on tightness of data points
Lang Deqin
Abstract
Lang Deqin
Abstract
Locally Linear Embedding(LLE)algorithm is one of the nonlinear data dimensionality reduction approaches based on manifold learning. Considering the distribution of data points mostly present the heterogeneity, there will result in large amounts ofinformation loss when LLE selects neighboring points. This paper proposes a novel locally linear embedding algorithm based on tightness of data points, named tLLE, which can reduce dimensionality effectively for the datasets that present the non-uniform distribution. And, it has better effects of dimensionality reduction than LLE. The embedding and classification results on synthetic and real data show that tLLE is very effective.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Locally Linear Embedding(LLE)algorithm is one of the nonlinear data dimensionality reduction approaches based on manifold learning. Considering the distribution of data points mostly present the heterogeneity, there will result in large amounts ofinformation loss when LLE selects neighboring points. This paper proposes a novel locally linear embedding algorithm based on tightness of data points, named tLLE, which can reduce dimensionality effectively for the datasets that present the non-uniform distribution. And, it has better effects of dimensionality reduction than LLE. The embedding and classification results on synthetic and real data show that tLLE is very effective.
Key concepts: Nonlinear dimensionality reduction, Dimensionality reduction, Embedding, Semidefinite embedding, Curse of dimensionality, Data point, Manifold (fluid mechanics), Computer science