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...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Nature Portfolio
2025-03-01
|
| سلاسل: | Scientific Reports |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://doi.org/10.1038/s41598-025-92564-x |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|