Distance‐preserving dimensionality reduction
Author:
- 14 June 2011
- journal article
- overview
- Published by Wiley in WIREs Data Mining and Knowledge Discovery
- Vol. 1 (5) , 369-380
Abstract
This paper presents an overview of basic concepts and principles that deal with the problem of mapping high‐dimensional data to low‐dimensional space such that distances between all or some pairs of data points are preserved. It introduces related techniques and systematizes today's methods into linear methods, methods using iterative optimization, methods preserving exact distances, methods using geodesic distances, and methods using alignments of local models. It discusses these methods by focusing on their basic ideas, by summarizing their common features and differences, and by comparing their strengths and weaknesses. This paper assumes no familiarity with dimensionality reduction. The main text should be readable by people with little technical background. Technical information of important algorithms is briefly presented in sidebars, the reading of which assumes basics in statistics and matrix computation. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 369–380 DOI: 10.1002/widm.39This article is categorized under: Technologies > Data Preprocessing Technologies > Machine LearningKeywords
This publication has 20 references indexed in Scilit:
- Alignment of Overlapping Locally Scaled Patches for Multidimensional Scaling and Dimensionality ReductionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Distance-preserving projection of high-dimensional data for nonlinear dimensionality reductionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space AlignmentSIAM Journal on Scientific Computing, 2004
- Laplacian Eigenmaps for Dimensionality Reduction and Data RepresentationNeural Computation, 2003
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional dataProceedings of the National Academy of Sciences, 2003
- Random projection in dimensionality reduction2001
- Nonlinear Dimensionality Reduction by Locally Linear EmbeddingScience, 2000
- A Global Geometric Framework for Nonlinear Dimensionality ReductionScience, 2000
- Nonlinear Component Analysis as a Kernel Eigenvalue ProblemNeural Computation, 1998
- Curvilinear component analysis: a self-organizing neural network for nonlinear mapping of data setsIEEE Transactions on Neural Networks, 1997