Multiple manifold learning by nonlinear dimensionality reduction

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Methods for nonlinear dimensionality reduction have been widely used for different purposes, but they are constrained to single manifold datasets. Considering that in real world applications, like video and image analysis, datasets with multiple manifolds are common, we propose a framework to find a low-dimensional embedding for data lying on multiple manifolds. Our approach is inspired on the manifold learning algorithm Laplacian Eigenmaps - LEM, computing the relationships among samples of different datasets based on an intra manifold comparison to unfold properly the data underlying structure. According to the results, our approach shows meaningful embeddings that outperform the results obtained by the conventional LEM algorithm and a previous close related work that analyzes multiple manifolds. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Valencia-Aguirre, J., Álvarez-Meza, A., Daza-Santacoloma, G., Acosta-Medina, C., & Castellanos-Domínguez, C. G. (2011). Multiple manifold learning by nonlinear dimensionality reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7042 LNCS, pp. 206–213). https://doi.org/10.1007/978-3-642-25085-9_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free