Nonlinear Dimensionality Reduction by Locally Linear Inlaying
- 13 January 2009
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 20 (2), 300-315
- https://doi.org/10.1109/tnn.2008.2005582
Abstract
High-dimensional data is involved in many fields of information processing. However, sometimes, the intrinsic structures of these data can be described by a few degrees of freedom. To discover these degrees of freedom or the low-dimensional nonlinear manifold underlying a high-dimensional space, many manifold learning algorithms have been proposed. Here we describe a novel algorithm, locally linear inlaying (LLI), which combines simple geometric intuitions and rigorously established optimality to compute the global embedding of a nonlinear manifold. Using a divide-and-conquer strategy, LLI gains some advantages in itself. First, its time complexity is linear in the number of data points, and hence LLI can be implemented efficiently. Second, LLI overcomes problems caused by the nonuniform sample distribution. Third, unlike existing algorithms such as isometric feature mapping (Isomap), local tangent space alignment (LTSA), and locally linear coordination (LLC), LLI is robust to noise. In addition, to evaluate the embedding results quantitatively, two criteria based on information theory and Kolmogorov complexity theory, respectively, are proposed. Furthermore, we demonstrated the efficiency and effectiveness of our proposal by synthetic and real-world data sets.Keywords
This publication has 21 references indexed in Scilit:
- Robust non-linear dimensionality reduction using successive 1-dimensional Laplacian EigenmapsPublished by Association for Computing Machinery (ACM) ,2007
- High-Dimensional Entropy Estimation for Finite Accuracy Data: R-NN Entropy EstimatorLecture Notes in Computer Science, 2007
- Robust locally linear embeddingPattern Recognition, 2006
- Approximating the smallest grammarPublished by Association for Computing Machinery (ACM) ,2002
- Fundamentals of Matrix ComputationsPublished by Wiley ,2002
- Mixture of Probabilistic Factor Analysis Model and Its ApplicationsLecture Notes in Computer Science, 2001
- Nonlinear Dimensionality Reduction by Locally Linear EmbeddingScience, 2000
- A Global Geometric Framework for Nonlinear Dimensionality ReductionScience, 2000
- Possible generalization of Boltzmann-Gibbs statisticsJournal of Statistical Physics, 1988
- Robust StatisticsWiley Series in Probability and Statistics, 1981