DocumentCode
2608150
Title
Building Connected Neighborhood Graphs for Locally Linear Embedding
Author
Li Yang
Author_Institution
Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI
Volume
4
fYear
0
fDate
0-0 0
Firstpage
194
Lastpage
197
Abstract
Locally linear embedding is a nonlinear method for dimensionality reduction and manifold learning. It requires well-sampled input data in high dimensional space so that neighborhoods of all data points overlap with each other. In this paper, we build connected neighborhood graphs for the purpose of assigning neighbor points. A few methods are examined to build connected neighborhood graphs. They have made LLE applicable to a wide range of data including under-sampled data and non-uniformly distributed data. These methods are compared through experiments on both synthetic and real world data sets
Keywords
graph theory; learning (artificial intelligence); connected neighborhood graphs; dimensionality reduction; locally linear embedding; manifold learning; Computer science; Data mining; Euclidean distance; Linear approximation; Nearest neighbor searches; Tree graphs; Virtual colonoscopy; Dimensionality reduction; embedding; locally linear; manifold learning.;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 2006. ICPR 2006. 18th International Conference on
Conference_Location
Hong Kong
ISSN
1051-4651
Print_ISBN
0-7695-2521-0
Type
conf
DOI
10.1109/ICPR.2006.345
Filename
1699814
Link To Document