Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
A 2011 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: