Robust self supervised symmetric nonnegative matrix factorization to the graph clustering
Abstract Graph clustering is a fundamental task in network analysis, aimed at uncovering meaningful groups of nodes based on structural and attribute-based similarities. Traditional Nonnegative Matrix Factorization (NMF) methods have shown promise in clustering tasks by providing low-dimensional rep...
Saved in:
| Main Authors: | Yi Ru, Michael Gruninger, YangLiu Dou |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-03-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-92564-x |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Feature representation via graph-regularized entropy-weighted nonnegative matrix factorization
by: Hazhir Sohrabi, et al.
Published: (2024-10-01) -
Adversarial Graph Regularized Deep Nonnegative Matrix Factorization for Data Representation
by: Songtao Li, et al.
Published: (2022-01-01) -
Multiview Deep Autoencoder-Inspired Layerwise Error-Correcting Non-Negative Matrix Factorization
by: Yuan Liu, et al.
Published: (2025-04-01) -
Large-Scale Cortical Network Analysis and Classification of MI-BCI Tasks Based on Bayesian Nonnegative Matrix Factorization
by: Shiqi Yu, et al.
Published: (2024-01-01) -
A fully encapsulated piezoelectric–triboelectric hybrid nanogenerator for energy harvesting from biomechanical and environmental sources
by: C. Y. Chen, et al.
Published: (2019-06-01)