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...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Nature Portfolio
2025-03-01
|
| Edice: | Scientific Reports |
| Témata: | |
| On-line přístup: | https://doi.org/10.1038/s41598-025-92564-x |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
