Robust graph regularized nonnegative matrix factorization for clustering
type: Item
instance of: scholarly article
title: Robust graph regularized nonnegative matrix factorization for clustering
zbMATH Open document ID: 1411.62168
author: Shudong Huang
author: Hongjun Wang
author: Tao Li
author: Tianrui Li
author: Zenglin Xu
published in: Data Mining and Knowledge Discovery
publication date: 2019-05-03T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 15A23
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 7050571
zbMATH Keywords: nonnegative matrix factorization
zbMATH Keywords: robust regularization
zbMATH Keywords: \(\ell _{1}\)-norm function
zbMATH Keywords: clustering
describes a project that uses: UCI-ml
describes a project that uses: CLUTO
MaRDI profile type: Publication
full work available at URL: s10618-017-0543-9
OpenAlex ID: W2765771013
Wikidata QID: Q114827251
cites work: Optimization with sparsity-inducing penalties
cites work: Q3174044
cites work: Robust principal component analysis?
cites work: Q3723487
cites work: Q3093232
cites work: Solving non-negative matrix factorization by alternating least squares with a modified strategy
cites work: A fast tri-factorization method for low-rank matrix recovery and completion
cites work: Nonnegative matrix factorization for spectral data analysis
cites work: Graph dual regularization non-negative matrix factorization for co-clustering
cites work: Large Scale Graph Regularized Non-Negative Matrix Factorization With ${\cal \ell}_1$ Normalization Based on Kullback–Leibler Divergence
cites work: Community discovery using nonnegative matrix factorization
cites work: Q3073081
DOI: 10.1007/S10618-017-0543-9
description: scientific article; zbMATH DE number 7050571