LGOct 20, 2024

Symmetry Nonnegative Matrix Factorization Algorithm Based on Self-paced Learning

arXiv:2410.15306v1h-index: 20
Originality Synthesis-oriented
AI Analysis

This is an incremental improvement for clustering tasks in domains like image and text analysis.

The paper tackled the problem of improving clustering performance by proposing a symmetric nonnegative matrix factorization algorithm based on self-paced learning, which better distinguishes normal from abnormal samples, and experimental results on multiple datasets demonstrated its effectiveness.

A symmetric nonnegative matrix factorization algorithm based on self-paced learning was proposed to improve the clustering performance of the model. It could make the model better distinguish normal samples from abnormal samples in an error-driven way. A weight variable that could measure the degree of difficulty to all samples was assigned in this method, and the variable was constrained by adopting both hard-weighting and soft-weighting strategies to ensure the rationality of the model. Cluster analysis was carried out on multiple data sets such as images and texts, and the experimental results showed the effectiveness of the proposed algorithm.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes