Efficient methods for grouping vectors into low-rank clusters
DOI10.1016/J.JCP.2011.03.048zbMATH Open1220.65053OpenAlexW2000214323MaRDI QIDQ550984FDOQ550984
Authors: Aaditya V. Rangan 
Publication date: 13 July 2011
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2011.03.048
Recommendations
algorithmsnumerical examplesquicksortsubdivision schemedata-analysishierarchical factorizationlow-rank clustersmatrix-compressionprincipal-component-analysisvector sorting
Factor analysis and principal components; correspondence analysis (62H25) Searching and sorting (68P10)
Cites Work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Randomized algorithms for the low-rank approximation of matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- On the Compression of Low Rank Matrices
- A randomized algorithm for the decomposition of matrices
- A fast randomized algorithm for the approximation of matrices
- The Mailman algorithm: a note on matrix-vector multiplication
Cited In (5)
- A simple filter for detecting low-rank submatrices
- Detecting low-rank clusters via random sampling
- Consistent clustering of entries in large pairwise comparison matrices
- Research project grouping and ranking by using adaptive Mahalanobis clustering
- Exemplar-based low-rank matrix decomposition for data clustering
Uses Software
This page was built for publication: Efficient methods for grouping vectors into low-rank clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550984)
