Taking all positive eigenvectors is suboptimal in classical multidimensional scaling
From MaRDI portal
Publication:2828334
Abstract: It is hard to overstate the importance of multidimensional scaling as an analysis technique in the broad sciences. Classical, or Torgerson multidimensional scaling is one of the main variants, with the advantage that it has a closed-form analytic solution. However, this solution is exact if and only if the distances are Euclidean. Conversely, there has been comparatively little discussion on what to do in the presence of negative eigenvalues: the intuitive solution, prima facie justifiable in least-squares terms, is to take every positive eigenvector as a dimension. We show that this, minimizing least-squares to the centred distances instead of the true distances, is suboptimal - throwing away positive eigenvectors can decrease the error even as we project to fewer dimensions. We provide provably better methods for handling this common case.
Recommendations
- Better initial configurations for metric multidimensional scaling
- The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method
- Extensions of classical multidimensional scaling via variable reduction
- scientific article; zbMATH DE number 756189
- Multidimensional scaling of noisy high dimensional data
Cites work
- scientific article; zbMATH DE number 5286897 (Why is no real title available?)
- scientific article; zbMATH DE number 36682 (Why is no real title available?)
- Euclidean distance matrices and applications
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Modern multidimensional scaling. Theory and applications.
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Some properties of clasical multi-dimesional scaling
- The analytical solution of the additive constant problem
Cited in
(7)- Multidimensional scaling of noisy high dimensional data
- A convex matrix optimization for the additive constant problem in multidimensional scaling with application to locally linear embedding
- A dual basis approach to multidimensional scaling
- Goodness-of-fit filtering in classical metric multidimensional scaling with large datasets
- An analysis of classical multidimensional scaling with applications to clustering
- Horseshoes in multidimensional scaling and local kernel methods
- Central limit theorems for classical multidimensional scaling
This page was built for publication: Taking all positive eigenvectors is suboptimal in classical multidimensional scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828334)
