Building Connected Neighborhood Graphs for Locally Linear Embedding

Authors:
Li Yang
Affiliations:
Western Michigan University, Kalamazoo
Venue:
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 04
Year:
2006

Citing 0
Cited 4

Topology Preservation Measures in the Visualization of Manifold-Type Multidimensional Data

Informatica
Adaptive Neighborhood Select Based on Local Linearity for Nonlinear Dimensionality Reduction

ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
Dynamic Neighborhood Selection for Nonlinear Dimensionality Reduction

MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
Improved locally linear embedding by cognitive geometry

LSMS'07 Proceedings of the 2007 international conference on Life System Modeling and Simulation

Quantified Score

Hi-index	0.00

Visualization

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.