Locally Linear Embedding Algorithm with Adaptive Neighbors

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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2009 International Workshop on Intelligent Systems and Applications s. 1 - 4
Hlavní autori: Huang, Lingzhu, Zheng, Lingxiang, Chen, Caiyue, Lu, Min
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.05.2009
Predmet:
Data structures
Euclidean distance
Face recognition
Information science
Nearest neighbor searches
Optimization methods
Space technology
Vectors
ISBN:9781424438938, 1424438934
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISBN:9781424438938
1424438934
DOI:10.1109/IWISA.2009.5072944