Dual graph-regularized sparse concept factorization for clustering

DOI10.1016/j.ins.2022.05.101WikidataQ114167336 ScholiaQ114167336MaRDI QIDQ6195206

No author found.

Publication date: 13 March 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

noiseclusteringsparsityconcept factorization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph dual regularization non-negative matrix factorization for co-clustering
• Semi-supervised concept factorization for document clustering
• Pairwise constrained concept factorization for data representation
• Robust path-based spectral clustering
• Matrix Analysis and Applications
• Learning the parts of objects by non-negative matrix factorization
• Signal Recovery by Proximal Forward-Backward Splitting
• Compressed sensing

This page was built for publication: Dual graph-regularized sparse concept factorization for clustering