A Distance-Preserving Matrix Sketch
From MaRDI portal
Publication:5057218
DOI10.1080/10618600.2022.2050246OpenAlexW3083789497MaRDI QIDQ5057218
Publication date: 16 December 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.03979
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Lower dimensional representation of text data based on centroids and least squares
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- The Grand Tour: A Tool for Viewing Multidimensional Data
- Multidimensional Scaling With Very Large Datasets
- Parallel Coordinates
- The Planar k-Means Problem is NP-Hard
- Relative-Error $CUR$ Matrix Decompositions
- Printer graphics for clustering
- Clustering Objects on Subsets of Attributes (with Discussion)
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Multiple Correspondence Analysis and Related Methods
- The biplot graphic display of matrices with application to principal component analysis
This page was built for publication: A Distance-Preserving Matrix Sketch