Detecting low-rank clusters via random sampling

DOI10.1016/J.JCP.2011.09.008zbMATH Open1243.65020OpenAlexW2017555472MaRDI QIDQ425614FDOQ425614

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

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

zbMATH Keywords

data analysisnumerical examplesalgorithmlow-rank clusterrandom rotation projection

Mathematics Subject Classification ID

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

Cites Work

• 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
• A randomized algorithm for the decomposition of matrices
• A fast randomized algorithm for the approximation of matrices
• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• Efficient methods for grouping vectors into low-rank clusters
• A randomized approximate nearest neighbors algorithm
• 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
• Title not available (Why is that?)

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)