A simple filter for detecting low-rank submatrices

DOI10.1016/J.JCP.2011.12.032zbMATH Open1242.65082OpenAlexW2043905333MaRDI QIDQ419636FDOQ419636

Authors: Aaditya V. Rangan 

Publication date: 18 May 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.12.032

Recommendations

• Detecting low-rank clusters via random sampling
• Fast monte-carlo algorithms for finding low-rank approximations
• Detection of a sparse submatrix of a high-dimensional noisy matrix
• Finding a low-rank basis in a matrix subspace
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

zbMATH Keywords

data analysisalgorithmbiclusteringrandom projectionmatrix compressiondetecting low-rank submatriceeccentric Gaussian distributions

Mathematics Subject Classification ID

Cites Work

• A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
• Title not available (Why is that?)
• Using underapproximations for sparse nonnegative matrix factorization
• Randomized algorithms for the low-rank approximation of matrices
• The maximum edge biclique problem is NP-complete
• A Fast Solver for HSS Representations via Sparse Matrices
• A randomized algorithm for the decomposition of matrices
• A fast randomized algorithm for the approximation of matrices
• Detecting low-rank clusters via random sampling
• Efficient methods for grouping vectors into low-rank clusters

Cited In (3)

• Detecting low-rank clusters via random sampling
• Efficient methods for grouping vectors into low-rank clusters
• Finding a low-rank basis in a matrix subspace

This page was built for publication: A simple filter for detecting low-rank submatrices

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