Back to Search
Start Over
Constrained Propagation Self-Adaptived Semi-Supervised Non-Negative Matrix Factorization Clustering Algorithm.
- Source :
- Journal of Computer Engineering & Applications; 7/1/2024, Vol. 60 Issue 13, p81-91, 11p
- Publication Year :
- 2024
-
Abstract
- Symmetric non-negative matrix factorization (NMF) can naturally capture the embedded clustering structure in the graph representation. It is an important method for linear and nonlinear data clustering applications. However, it is sensitive to the initialization of variables, and the quality of the initialization matrix greatly affects the clustering performance. In semi-supervised clustering, it faces the challenge of learning a more discriminative representation from limited labeled data. This paper introduces a constrained propagation self-adaptive self-supervised non-negative matrix factorization clustering algorithm (CPS³NMF) to solve the above problems. The algorithm propagates finite constraints to unconstrained data points, constructing a similarity matrix imbued with constraint information. The resultant similarity matrix serves the role of a non-negative symmetric matrix decomposition in SNMF and functions as graph regularization for the assignment matrix, fully utilizing the limited constraint information to preserve the geometrical structure of data space. Concurrently, leveraging the sensitivity of initial features in SNMF, the algorithm employs adaptively learned weights to rank the quality of multiple initial matrices. By integrating results from multiple clustering attempts, it progressively enhances the performance of semi-supervised clustering. Experiments on 6 public datasets show that the proposed CPS³NMF algorithm outperforms other state-of-the-art algorithms, proving its effectiveness in semi-supervised clustering. [ABSTRACT FROM AUTHOR]
Details
- Language :
- Chinese
- ISSN :
- 10028331
- Volume :
- 60
- Issue :
- 13
- Database :
- Complementary Index
- Journal :
- Journal of Computer Engineering & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 178275638
- Full Text :
- https://doi.org/10.3778/j.issn.1002-8331.2310-0218