M-Isomap: Orthogonal Constrained Marginal Isomap for Nonlinear Dimensionality Reduction
Authors:
- 3 July 2012
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 43 (1) , 180-191
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.Keywords
This publication has 18 references indexed in Scilit:
- Semisupervised Metric Learning by Maximizing Constraint MarginIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2011
- Bagging Constraint Score for feature selection with pairwise constraintsPattern Recognition, 2010
- Trace Ratio Problem RevisitedIEEE Transactions on Neural Networks, 2009
- Semi-supervised metric learning by maximizing constraint margin2008
- Feature Extraction by Maximizing the Average Neighborhood Margin2007
- Incremental nonlinear dimensionality reduction by manifold learningIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- Supervised Nonlinear Dimensionality Reduction for Visualization and ClassificationIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2005
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional dataProceedings of the National Academy of Sciences, 2003
- A generalized Foley–Sammon transform based on generalized fisher discriminant criterion and its application to face recognitionPattern Recognition Letters, 2003
- PCA versus LDAIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001