Clustered matrix approximation

DOI10.1137/15M1042206MaRDI QIDQ2834689zbMATH OpenOpenAlexFDO

Authors Berkant Savas, Inderjit S. Dhillon

Publication date 23 November 2016

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/15m1042206

zbMATH Keywords

clusteringdimensionality reductionmatrix approximationsocial network analysisprobabilistic algorithmsgraph mininglow rank matrix approximationcoclustering

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Basic linear algebra (15A99)

Recommendations

• scientific article; zbMATH DE number 1305418
• Sampling based succinct matrix approximation
• Clustering large graphs via the singular value decomposition
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Relative-Error $CUR$ Matrix Decompositions

Cites work

• scientific article; zbMATH DE number 1333614 (Why is no real title available?)
• A randomized algorithm for principal component analysis
• A survey of kernel and spectral methods for clustering
• An improved approximation algorithm for the column subset selection problem
• Clustered SVD strategies in latent semantic indexing
• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Concept decompositions for large sparse text data using clustering
• Emergence of Scaling in Random Networks
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Graclus
• Network properties revealed through matrix functions
• Numerical Methods for Computing Angles Between Linear Subspaces
• Numerical methods in matrix computations
• Structure and perturbation analysis of truncated SVDs for column-partitioned matrices

Cited in

(6)

• LLORMA: local low-rank matrix approximation
• Graph refinement via simultaneously low-rank and sparse approximation
• Sampling and multilevel coarsening algorithms for fast matrix approximations.
• Sparse topical analysis of dyadic data using matrix tri-factorization
• Sparse Matrix Computational Techniques in Concept Decomposition Matrix Approximation
• Structured Matrix Approximations via Tensor Decompositions

Describes a project that uses

Uses Software

• Graclus

This page was built for publication: Clustered matrix approximation

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