Orthogonal graph regularized non-negative matrix factorization under sparse constraints for clustering

Yasong Chen; Guangwei Qu; Junjian Zhao

doi:10.1016/j.eswa.2024.123797

ScienceGate Book Chapters

JOURNAL ARTICLE

Orthogonal graph regularized non-negative matrix factorization under sparse constraints for clustering

Yasong Chen Guangwei Qu Junjian Zhao

Year: 2024 Journal: Expert Systems with Applications Vol: 249 Pages: 123797-123797 Publisher: Elsevier BV

DOI: 10.1016/j.eswa.2024.123797

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Cluster analysis Matrix decomposition Sparse matrix Graph Non-negative matrix factorization Mathematics Artificial intelligence Theoretical computer science Eigenvalues and eigenvectors

Metrics

Cited By

9.54

FWCI (Field Weighted Citation Impact)

Refs

0.97

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Face and Expression Recognition

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Image Retrieval and Classification Techniques

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Neural Networks and Applications

Physical Sciences → Computer Science → Artificial Intelligence

Orthogonal graph regularized non-negative matrix factorization under sparse constraints for clustering

Metrics

Citation History

Topics

Related Documents

Dual-graph regularized non-negative matrix factorization with sparse and orthogonal constraints

Graph Regularized Sparse Non-Negative Matrix Factorization for Clustering

Graph regularized sparse non-negative matrix factorization for clustering

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

Orthogonal Graph-regularized Non-negative Matrix Factorization for Hyperspectral Image Clustering