Randomized algorithms for symmetric nonnegative matrix factorization

DOI10.1137/24M1638355MaRDI QIDQ7015961zbMATH OpenFDO

Authors Koby Hayashi, Sinan Aksoy, Grey Ballard, Haesun Park

Publication date 7 March 2025

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

Full work available at URL https://doi.org/10.1137/24M1638355

zbMATH Keywords

leverage scoresmatrix sketchingnonnegative matrix factorizationrandomized numerical linear algebra (RandNLA)symmetric nonnegative matrix factorization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Quadratic programming (90C20)

Cites work

• A Practical Randomized CP Tensor Decomposition
• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• Compressed Nonnegative Matrix Factorization Is Fast and Accurate
• CUR matrix decompositions for improved data analysis
• DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling
• Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
• Fast approximation of matrix coherence and statistical leverage
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Fast nonnegative matrix factorization: an active-set-like method and comparisons
• Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
• Faster least squares approximation
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
• Learning the parts of objects by non-negative matrix factorization
• Nonnegative matrix factorization
• PLANC
• Practical leverage-based sampling for low-rank tensor decomposition
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Random projections for the nonnegative least-squares problem
• Randomized Algorithms for Matrices and Data
• Randomized numerical linear algebra: Foundations and algorithms
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Sketching as a tool for numerical linear algebra
• Stability of the solution of definite quadratic programs
• Subspace Iteration Randomization and Singular Value Problems
• SVD based initialization: A head start for nonnegative matrix factorization
• SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering

Cited in

(2)

• Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization
• Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition

This page was built for publication: Randomized algorithms for symmetric nonnegative matrix factorization

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