A dual basis approach to multidimensional scaling

DOI10.1016/J.LAA.2023.11.004MaRDI QIDQ6185978zbMATH OpenOpenAlexFDO

Authors Samuel Lichtenberg, Abiy Tasissa

Publication date 9 January 2024

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

distance geometrydual basismatrix nearnessmultidimensional scaling

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Eigenvalue problems for linear operators (47A75) General theory of distance geometry (51K05)

Abstract: Classical multidimensional scaling (CMDS) is a technique that aims to embed a set of objects in a Euclidean space given their pairwise Euclidean distance matrix. The main part of CMDS is based on double centering a squared distance matrix and employing a truncated eigendecomposition to recover the point coordinates. A central result in CMDS connects the squared Euclidean matrix to a Gram matrix derived from the set of points. In this paper, we study a dual basis approach to classical multidimensional scaling. We give an explicit formula for the dual basis and fully characterize the spectrum of an essential matrix in the dual basis framework. We make connections to a related problem in metric nearness.

Recommendations

• Taking all positive eigenvectors is suboptimal in classical multidimensional scaling
• Extensions of classical multidimensional scaling via variable reduction
• scientific article; zbMATH DE number 4204190
• Multidimensional scaling on metric measure spaces
• Central limit theorems for classical multidimensional scaling

Cites work

• Exact matrix completion via convex optimization
• Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Matrix pencils: Theory, applications, and numerical methods
• Multidimensional scaling. I: Theory and method
• Recent advances on the discretizable molecular distance geometry problem
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• Some distance properties of latent root and vector methods used in multivariate analysis
• The Metric Nearness Problem
• Using a distributed SDP approach to solve simulated protein molecular conformation problems

Cited in

(2)

• Multi-dimensional scaling from \(K\)-nearest neighbourhood distances
• Uncovering the Euclidean Geometry of Data

This page was built for publication: A dual basis approach to multidimensional scaling

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