Robust graph regularized nonnegative matrix factorization for clustering

DOI10.1007/s10618-017-0543-9zbMath1411.62168OpenAlexW2765771013WikidataQ114827251 ScholiaQ114827251MaRDI QIDQ1741239

Zenglin Xu, Hongjun Wang, Tao Li, Tianrui Li, Shudong Huang

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-017-0543-9

zbMATH Keywords

clusteringnonnegative matrix factorization\(\ell _{1}\)-norm functionrobust regularization

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Factorization of matrices (15A23) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Unnamed Item

Uses Software

• UCI-ml
• CLUTO

Cites Work

• Graph dual regularization non-negative matrix factorization for co-clustering
• Community discovery using nonnegative matrix factorization
• A fast tri-factorization method for low-rank matrix recovery and completion
• Solving non-negative matrix factorization by alternating least squares with a modified strategy
• Nonnegative matrix factorization for spectral data analysis
• Optimization with Sparsity-Inducing Penalties
• Robust principal component analysis?
• Large Scale Graph Regularized Non-Negative Matrix Factorization With ${\cal \ell}_1$ Normalization Based on Kullback–Leibler Divergence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust graph regularized nonnegative matrix factorization for clustering