2012•Computer Engineering and Applications JournalOpen access

Local linear embedding algorithm based on tightness of data points

Lang Deqin

Open full text 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Nonlinear dimensionality reduction, Dimensionality reduction, Embedding, Semidefinite embedding, Curse of dimensionality, Data point, Manifold (fluid mechanics), Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Local linear embedding algorithm based on tightness of data points — Research Paper | ScholarLens