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

DOI10.1007/s10898-014-0247-2zbMath1326.90080OpenAlexW2067931421MaRDI QIDQ2351530

Haesun Park, Sangwoon Yun, Da Kuang

Publication date: 24 June 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0247-2

zbMATH Keywords

low-rank approximationspectral clusteringgraph clusteringsymmetric nonnegative matrix factorization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (19)

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

Uses Software

• RCV1
• CMU PIE
• BSDS
• t-SNE
• HierNMF2

Cites Work

• Community discovery using nonnegative matrix factorization
• A finite iterative algorithm for solving the generalized \((P,Q)\)-reflexive solution of the linear systems of matrix equations
• A block coordinate gradient descent method for regularized convex separable optimization and covariance selection
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• Semi-supervised graph clustering: a kernel approach
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• Document clustering using nonnegative matrix factorization
• Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
• Introduction to Information Retrieval
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Stochastic global optimization methods part II: Multi level methods
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Exploring complex networks
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Concept decompositions for large sparse text data using clustering
• Contour and texture analysis for image segmentation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering