Visualizing the effects of a changing distance on data using continuous embeddings
From MaRDI portal
Abstract: Most Machine Learning (ML) methods, from clustering to classification, rely on a distance function to describe relationships between datapoints. For complex datasets it is hard to avoid making some arbitrary choices when defining a distance function. To compare images, one must choose a spatial scale, for signals, a temporal scale. The right scale is hard to pin down and it is preferable when results do not depend too tightly on the exact value one picked. Topological data analysis seeks to address this issue by focusing on the notion of neighbourhood instead of distance. It is shown that in some cases a simpler solution is available. It can be checked how strongly distance relationships depend on a hyperparameter using dimensionality reduction. A variant of dynamical multi-dimensional scaling (MDS) is formulated, which embeds datapoints as curves. The resulting algorithm is based on the Concave-Convex Procedure (CCCP) and provides a simple and efficient way of visualizing changes and invariances in distance patterns as a hyperparameter is varied. A variant to analyze the dependence on multiple hyperparameters is also presented. A cMDS algorithm that is straightforward to implement, use and extend is provided. To illustrate the possibilities of cMDS, cMDS is applied to several real-world data sets.
Recommendations
- DISTANCE-RATIO LEARNING FOR DATA VISUALIZATION
- Labelings vs. Embeddings: On Distributed Representations of Distances
- Correction of distances in the visualization of multidimensional data
- Data Visualization by Pairwise Distortion Minimization
- Visualizing non-metric similarities in multiple maps
- A general framework for dimensionality-reducing data visualization mapping
Cites work
- scientific article; zbMATH DE number 3579883 (Why is no real title available?)
- scientific article; zbMATH DE number 1974104 (Why is no real title available?)
- scientific article; zbMATH DE number 756188 (Why is no real title available?)
- 8. Functional Data Analysis
- A coordinate gradient descent method for nonsmooth separable minimization
- A general nonmetric technique for finding the smallest coordinate space for a configuration of points
- A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
- A regularized graph layout framework for dynamic network visualization
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- An algorithm for drawing general undirected graphs
- Confidence regions for multidimensional scaling analysis
- Convergence of the majorization method for multidimensional scaling
- Convex Analysis
- Coordinate descent algorithms
- Finding Groups in Data
- Graph Drawing
- Graph Drawing
- Interactive and dynamic graphics for data analysis. With R and GGobi. With contributions by Andreas Buja, Duncan Temple Lang, Heike Hofmann, Hadley Wickham, and Michael Lawrence.
- Local multidimensional scaling for nonlinear dimension reduction, graph drawing, and proximity analysis
- Maximum likelihood estimation in multidimensional scaling
- Modern multidimensional scaling. Theory and applications.
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Multidimensional scaling. I: Theory and method
- On search directions for minimization algorithms
- Some distance properties of latent root and vector methods used in multivariate analysis
- The Concave-Convex Procedure
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- Topology and data
- Visualization methodology for multidimensional scaling
This page was built for publication: Visualizing the effects of a changing distance on data using continuous embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1658724)
