DocumentCode
2039766
Title
Locally Linear Embedding Algorithm with Adaptive Neighbors
Author
Huang Lingzhu ; Zheng Lingxiang ; Chen Caiyue ; Lu Min
Author_Institution
Sch. of Inf. Sci. & Technol., Xiamen Univ., Xiamen
fYear
2009
fDate
23-24 May 2009
Firstpage
1
Lastpage
4
Abstract
How to choose a proper number of the neighbors is an important issue of the locally linear embedding algorithm. To investigate this issue, we propose an optimized locally linear embedding algorithm with adaptive neighbors (ANLLE). The ANLLE selects the neighbors with a locally adaptive criterion. In addition, a new data point mapping method that computes the low-dimensional description of the correspondents is introduced in the ANLLE. The experiment results of the manifold expansion and the face recognition showed that the optimized algorithm is more effective than the original algorithm. The result of the present work implied that the ANLLE could improve the linear correlation of the neighbors and the data points. Moreover, it maintains the distance between the data points and reduces the application difficulty of the locally linear embedding algorithm.
Keywords
correlation theory; face recognition; adaptive neighbors; data point mapping method; face recognition; linear correlation; locally linear embedding algorithm; manifold expansion; Data structures; Euclidean distance; Face recognition; Information science; Nearest neighbor searches; Optimization methods; Space technology; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-3893-8
Electronic_ISBN
978-1-4244-3894-5
Type
conf
DOI
10.1109/IWISA.2009.5072944
Filename
5072944
Link To Document