Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICPR
2008
IEEE

favoriteEmaildiscussreport

143views Computer Vision» more ICPR 2008»

Clustering-based locally linear embedding

13 years 10 months ago

Clustering-based locally linear embedding

Download figment.cse.usf.edu

The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called clustering-based locally linear embedding (CLLE) is proposed, which is able to solve the problem of high time consuming of LLE and preserve the data topology at the same time. Then, how the proposed method achieves decreasing the time complexity of LLE is analyzed. Moreover, the further comparison shows that CLLE performs better in most cases than LLE on the time cost, topology preservation, and classification performance with several different data sets.

Kanghua Hui, Chunheng Wang

Real-time Traffic

Computer Vision | ICPR 2008 | Nonlinear Dimensionality Reduction | Powerful Method | Time Complexity |

claim paper

Related Content

» A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localizat...

» Clustering based pruning for statistical criticality computation under process variations

» Local Fisher Embedding

» Articulated Shape Matching Using Locally Linear Embedding and Orthogonal Alignment

» Robust locally linear embedding

» Semisupervised learning by locally linear embedding in kernel space

» A local linear embedding module for evolutionary computation optimization

» Supervised Locally Linear Embedding Algorithm for Pattern Recognition

» Unsupervised Learning Using Locally Linear Embedding Experiments with Face Pose Analysis

Post Info
More Details (n/a)

Added	30 May 2010
Updated	30 May 2010
Type	Conference
Year	2008
Where	ICPR
Authors	Kanghua Hui, Chunheng Wang

Comments (0)