Detecting low-rank clusters via random sampling

DOI10.1016/J.JCP.2011.09.008MaRDI QIDQ425614zbMATH OpenOpenAlexFDO

Authors Aaditya V. Rangan

Publication date 8 June 2012

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcp.2011.09.008

zbMATH Keywords

data analysisnumerical examplesalgorithmlow-rank clusterrandom rotation projection

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• A simple filter for detecting low-rank submatrices
• Efficient methods for grouping vectors into low-rank clusters
• Fast monte-carlo algorithms for finding low-rank approximations
• scientific article; zbMATH DE number 1305418
• A randomized algorithm for principal component analysis

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
• A randomized approximate nearest neighbors algorithm
• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• Efficient methods for grouping vectors into low-rank clusters
• Randomized algorithms for the low-rank approximation of matrices
• The Mailman algorithm: a note on matrix-vector multiplication

Cited in

(3)

• A simple filter for detecting low-rank submatrices
• Efficient methods for grouping vectors into low-rank clusters
• scientific article; zbMATH DE number 6850339 (Why is no real title available?)

This page was built for publication: Detecting low-rank clusters via random sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425614)