An efficient network clustering approach using graph-boosting and nonnegative matrix factorization

Abstract

Network clustering is a critical task in data analysis, aimed at uncovering the underlying structure and patterns within complex networks. Traditional clustering methods often struggle with large-scale and noisy data, leading to suboptimal results. Also, the efficiency of positive samples in network clustering depends on the carefully constructed data augmentation, and the pre-training process of the model deals with large-scale data. To address these issues, in this paper, we introduce an efficient network clustering approach that leverages Graph-Boosting and Nonnegative Matrix Factorization to enhance clustering performance (GBNMF). Our algorithm addresses the limitations of traditional clustering techniques by incorporating the strengths of graph-boosting, which iteratively improves the quality of clusters, and Nonnegative Matrix Factorization (NMF), which effectively captures latent structures within the data. We validate our algorithm through extensive experiments on various benchmark network datasets, demonstrating significant improvements in clustering accuracy and robustness. The proposed algorithm not only achieves superior clustering results but also exhibits remarkable computational efficiency, making it a valuable tool for large-scale network analysis applications.