A Distance-Preserving Matrix Sketch
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3885093 (Why is no real title available?)
- scientific article; zbMATH DE number 1792112 (Why is no real title available?)
- scientific article; zbMATH DE number 3429948 (Why is no real title available?)
- scientific article; zbMATH DE number 3374823 (Why is no real title available?)
- Clustering Objects on Subsets of Attributes (with Discussion)
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Feature selection for unsupervised learning
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Graphics of large datasets. Visualizing a million.
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Lower dimensional representation of text data based on centroids and least squares
- Multidimensional Scaling With Very Large Datasets
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Multiple Correspondence Analysis and Related Methods
- Parallel Coordinates
- Printer graphics for clustering
- Relative-Error CUR Matrix Decompositions
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- The Grand Tour: A Tool for Viewing Multidimensional Data
- The Planar k-Means Problem is NP-Hard
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- The biplot graphic display of matrices with application to principal component analysis
- Visualizing data using t-SNE
Cited in
(2)
This page was built for publication: A Distance-Preserving Matrix Sketch
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057218)