Graph regularized semi-nonnegative matrix factorization under sparse constraints for clustering

DOI10.1007/S11081-025-10064-3MaRDI QIDQ7268349zbMATH OpenFDO

Authors Caiping Wang, Jiaxi Cai, Guangwei Qu, Junjian Zhao, Yasong Chen

Publication date 17 June 2026

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11081-025-10064-3

zbMATH Keywords

clusteringgraph regularizationimage denoisingsemi-NMFsparse constraints

Mathematics Subject Classification ID

Graph theory (05Cxx) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites work

• A direct LDA algorithm for high-dimensional data -- with application to face recognition
• Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Learning the parts of objects by non-negative matrix factorization
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
• Principal component analysis: a review and recent developments
• Robust graph regularized nonnegative matrix factorization for clustering
• Two-dimensional semi-nonnegative matrix factorization for clustering

This page was built for publication: Graph regularized semi-nonnegative matrix factorization under sparse constraints for clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7268349)