SymNMF

swMATH12668MaRDI QIDQ24594FDOQ24594

Author name not available (Why is that?)

Source code repository: https://github.com/andybaoxv/symnmf

Described by source

• SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering

Cited In (14)

• ORCA: outlier detection and robust clustering for attributed graphs
• Algorithms for positive semidefinite factorization
• An adaptive procedure for the global minimization of a class of polynomial functions
• Self-Assignment Flows for Unsupervised Data Labeling on Graphs
• Blind Nonnegative Source Separation Using Biological Neural Networks
• Quartic first-order methods for low-rank minimization
• Off-diagonal symmetric nonnegative matrix factorization
• An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization
• DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling
• A polynomial-time algorithm for computing low CP-rank decompositions
• Adaptive computation of the symmetric nonnegative matrix factorization (SymNMF)
• Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
• Multi-view clustering based on graph-regularized nonnegative matrix factorization for object recognition
• Weakly supervised nonnegative matrix factorization for user-driven clustering

This page was built for software: SymNMF