Efficient methods for grouping vectors into low-rank clusters

DOI10.1016/J.JCP.2011.03.048MaRDI QIDQ550984zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsnumerical examplesquicksortsubdivision schemedata-analysishierarchical factorizationlow-rank clustersmatrix-compressionprincipal-component-analysisvector sorting

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Searching and sorting (68P10)

Recommendations

• Detecting low-rank clusters via random sampling
• A simple filter for detecting low-rank submatrices
• scientific article; zbMATH DE number 1305418
• Matrix approximation and projective clustering via volume sampling
• Clustering large graphs via the singular value decomposition

Cites work

• scientific article; zbMATH DE number 5161643 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1012640 (Why is no real title available?)
• A fast randomized algorithm for the approximation of matrices
• A randomized algorithm for the decomposition of matrices
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• On the Compression of Low Rank Matrices
• Randomized algorithms for the low-rank approximation of matrices
• The Mailman algorithm: a note on matrix-vector multiplication

Cited in

(5)

• Research project grouping and ranking by using adaptive Mahalanobis clustering
• A simple filter for detecting low-rank submatrices
• Detecting low-rank clusters via random sampling
• Exemplar-based low-rank matrix decomposition for data clustering
• Consistent clustering of entries in large pairwise comparison matrices

Describes a project that uses

Uses Software

• UCI

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)