An Iterative Locally Linear Embedding Algorithm

06/27/2012
by   Deguang Kong, et al.
0

Local Linear embedding (LLE) is a popular dimension reduction method. In this paper, we first show LLE with nonnegative constraint is equivalent to the widely used Laplacian embedding. We further propose to iterate the two steps in LLE repeatedly to improve the results. Thirdly, we relax the kNN constraint of LLE and present a sparse similarity learning algorithm. The final Iterative LLE combines these three improvements. Extensive experiment results show that iterative LLE algorithm significantly improve both classification and clustering results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/16/2008

Local Procrustes for Manifold Embedding: A Measure of Embedding Quality and Embedding Algorithms

We present the Procrustes measure, a novel measure based on Procrustes r...
research
09/14/2021

ε-isometric dimension reduction for incompressible subsets of ℓ_p

Fix p∈[1,∞), K∈(0,∞) and a probability measure μ. We prove that for ever...
research
10/12/2021

Nonnegative spatial factorization

Gaussian processes are widely used for the analysis of spatial data due ...
research
08/30/2019

Fast and Accurate Network Embeddings via Very Sparse Random Projection

We present FastRP, a scalable and performant algorithm for learning dist...
research
06/02/2011

Learning Hierarchical Sparse Representations using Iterative Dictionary Learning and Dimension Reduction

This paper introduces an elemental building block which combines Diction...
research
11/29/2022

A novel convergence enhancement method based on Online Dimension Reduction Optimization

Iterative steady-state solvers are widely used in computational fluid dy...
research
12/15/2020

Certifiably Optimal Sparse Sufficient Dimension Reduction

Sufficient dimension reduction (SDR) is a popular tool in regression ana...

Please sign up or login with your details

Forgot password? Click here to reset