Fangfang Li

Structural graph clustering is a data analysis technique that groups nodes within a graph based on their connectivity and structural similarity. The Structural graph clustering SCAN algorithm, a density-based clustering method, effectively identifies core points and their neighbors within areas of high density to form well-defined clusters. However, the clustering quality of SCAN heavily depends on the input parameters, $ϵ$ and $\mu$, making the clustering results highly sensitive to parameter selection. Different parameter settings can lead to significant differences in clustering results, potentially compromising the accuracy of the clusters. To address this issue, a novel structural graph clustering algorithm based on the adaptive selection of density peaks is proposed in this paper. Unlike traditional methods, our algorithm does not rely on external parameters and eliminates the need for manual selection of density peaks or cluster centers by users. Density peaks are adaptively identified using the generalized extreme value distribution, with consideration of the structural similarities and interdependencies among nodes, and clusters are expanded by incorporating neighboring nodes, enhancing the robustness of the clustering process. Additionally, a distance-based structural similarity method is proposed to re-cluster noise nodes to the correct clusters. Extensive experiments on real and synthetic graph datasets validate the effectiveness of our algorithm. The experiment results show that the ADPSCAN has a superior performance compared with several state-of-the-art (SOTA) graph clustering methods.