.png){kind=icon}
.png){kind=icon}
Return
RMFSVD: robust graph clustering based on matrix factorization and singular value decomposition
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-025-01581-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph clustering is a crucial technique in network analysis for discovering latent group structures within complex graphs. However, traditional clustering approaches based on Nonnegative Matrix Factorization (NMF) often suffer from sensitivity to noise, outliers, and the inability to capture nonlinear structural patterns. To overcome these challenges, we propose a Robust Matrix Factorization framework based on Singular Value Decomposition (RMFSVD) for accurate and noise-resilient graph clustering. RMFSVD leverages a low-rank approximation scheme with robust singular value decomposition techniques to effectively extract meaningful latent features while enhancing resilience to noisy and incomplete data. Specifically, RMFSVD decomposes the input similarity matrix into a clean low-rank component and a sparse noise matrix, enabling effective separation of structural information from noise. In addition, RMFSVD employs a graph-boosting strategy to reinforce and improve the modeling of inter-node relationships across the network. Extensive experiments on multiple benchmark graph datasets demonstrate that RMFSVD outperforms existing state-of-the-art clustering methods in terms of robustness, scalability, and clustering performance.
Keywords:
Graph clustering
Robust clustering
Nonnegative matrix factorization
Singular value decomposition
Journal
C
IF:
2.8
Papers:
2.3K
Citations:
3.5K