Journal Article10.1109/TSMCB.2012.2202901
M-Isomap: Orthogonal Constrained Marginal Isomap for Nonlinear Dimensionality Reduction
100
TL;DR: The pairwise Cannot-Link and Must-Link constraints are used to specify the types of neighborhoods and it is shown that M-Isomap delivers comparable or even better results than some state-of-the-art DR algorithms.
read more
Abstract: Isomap is a well-known nonlinear dimensionality reduction (DR) method, aiming at preserving geodesic distances of all similarity pairs for delivering highly nonlinear manifolds. Isomap is efficient in visualizing synthetic data sets, but it usually delivers unsatisfactory results in benchmark cases. This paper incorporates the pairwise constraints into Isomap and proposes a marginal Isomap (M-Isomap) for manifold learning. The pairwise Cannot-Link and Must-Link constraints are used to specify the types of neighborhoods. M-Isomap computes the shortest path distances over constrained neighborhood graphs and guides the nonlinear DR through separating the interclass neighbors. As a result, large margins between both interand intraclass clusters are delivered and enhanced compactness of intracluster points is achieved at the same time. The validity of M-Isomap is examined by extensive simulations over synthetic, University of California, Irvine, and benchmark real Olivetti Research Library, YALE, and CMU Pose, Illumination, and Expression databases. The data visualization and clustering power of M-Isomap are compared with those of six related DR methods. The visualization results show that M-Isomap is able to deliver more separate clusters. Clustering evaluations also demonstrate that M-Isomap delivers comparable or even better results than some state-of-the-art DR algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Feature dimensionality reduction: a review
TL;DR: In this paper , two-dimensional reduction methods, feature selection and feature extraction, are introduced; the current mainstream dimensionality reduction algorithms are analyzed, including the method for small sample and method based on deep learning.
•Posted Content
Joint Label Prediction based Semi-Supervised Adaptive Concept Factorization for Robust Data Representation.
TL;DR: A joint label prediction based Robust Semi-Supervised Adaptive Concept Factorization (RS2ACF) framework that incorporates the joint neighborhood reconstruction error over the new representations and predicted labels of both labeled and unlabeled data, so the manifold structures can be preserved explicitly and adaptively in the representation space and label space at the same time.
Robust locally linear embedding algorithm for machinery fault diagnosis
TL;DR: A robust LLE (RLLE) is investigated and a novel fault diagnosis method based on RLLE and support vector machine (SVM) are proposed for machinery fault diagnosis.
41
Supervised discriminant Isomap with maximum margin graph regularization for dimensionality reduction
TL;DR: A novel dimensionality reduction method called supervised discriminant Isomap is proposed to solve the first two problems mentioned above and can capture more discriminative information from raw data than other isomap based methods.
37
A Survey on Concept Factorization: From Shallow to Deep Representation Learning
TL;DR: This survey provides an insightful overview of both theoretical basis and current developments in the field of CF, which can help the interested researchers to understand the current trends of CF and find the most appropriate CF techniques to deal with particular applications.
32
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
Nonlinear dimensionality reduction by locally linear embedding.
Sam T. Roweis,Lawrence K. Saul +1 more
TL;DR: Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
A global geometric framework for nonlinear dimensionality reduction.
TL;DR: An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
Introduction to algorithms: 4. Turtle graphics
TL;DR: In this article, a language similar to logo is used to draw geometric pictures using this language and programs are developed to draw geometrical pictures using it, which is similar to the one we use in this paper.
15.4K
Laplacian Eigenmaps for dimensionality reduction and data representation
Mikhail Belkin,Partha Niyogi +1 more
TL;DR: In this article, the authors proposed a geometrically motivated algorithm for representing high-dimensional data, based on the correspondence between the graph Laplacian, the Laplace Beltrami operator on the manifold and the connections to the heat equation.