Symmetry Nonnegative Matrix Factorization Algorithm Based on Self-paced Learning

Lei Wang, Liang Du, Peng Zhou, Peng Wu
10/20/2024
cs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wang2024symmetry,
  title  = {Symmetry Nonnegative Matrix Factorization Algorithm Based on Self-paced Learning},
  author = {Lei Wang and Liang Du and Peng Zhou and Peng Wu},
  year   = {2024},
  eprint = {2410.15306},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.15306v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.15306.svg)](https://codeofpaper.com/paper/2410.15306)

Discussion