Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization

DOI10.1007/s10898-017-0578-xzbMath1434.15011arXiv1703.09646OpenAlexW2600446419MaRDI QIDQ2274860

Rundong Du, Haesun Park, Barry Drake

Publication date: 1 October 2019

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

Full work available at URL: https://arxiv.org/abs/1703.09646

zbMATH Keywords

graph clusteringconstrained low rank approximationcontent clusteringhybrid content and connection structure analysisjoint nonnegative matrix factorizationsymmetric NMF

Mathematics Subject Classification ID

Factorization of matrices (15A23) Combinatorial optimization (90C27)

Related Items (2)

An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization ⋮ ORCA: outlier detection and robust clustering for attributed graphs

Uses Software

• SNAP
• SymNMF
• SmallK
• HierNMF2

Cites Work

• Unnamed Item
• An alternating direction algorithm for matrix completion with nonnegative factors
• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• Hierarchical relational models for document networks
• SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
• Bounded Matrix Low Rank Approximation
• Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
• Introduction to Information Retrieval
• 10.1162/153244303321897735

This page was built for publication: Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization