Subspace Least Squares Multidimensional Scaling

From MaRDI portal
Publication:5864047

DOI10.1007/978-3-319-58771-4_54zbMATH Open1489.68318arXiv1709.03484OpenAlexW2614356504MaRDI QIDQ5864047FDOQ5864047


Authors: Amit Boyarski, Alex M. Bronstein, Michael M. Bronstein Edit this on Wikidata


Publication date: 3 June 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: Multidimensional Scaling (MDS) is one of the most popular methods for dimensionality reduction and visualization of high dimensional data. Apart from these tasks, it also found applications in the field of geometry processing for the analysis and reconstruction of non-rigid shapes. In this regard, MDS can be thought of as a extit{shape from metric} algorithm, consisting of finding a configuration of points in the Euclidean space that realize, as isometrically as possible, some given distance structure. In the present work we cast the least squares variant of MDS (LS-MDS) in the spectral domain. This uncovers a multiresolution property of distance scaling which speeds up the optimization by a significant amount, while producing comparable, and sometimes even better, embeddings.


Full work available at URL: https://arxiv.org/abs/1709.03484




Recommendations





Cited In (20)





This page was built for publication: Subspace Least Squares Multidimensional Scaling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864047)