Spectral clustering based on the local similarity measure of shared neighbors

Spectral clustering has become a typical and efficient clustering method used in a variety of applications. The critical step of spectral clustering is the similarity measurement, which largely determines the performance of the spectral clustering method. In this paper, we propose a novel spectral clustering algorithm based on the local similarity measure of shared neighbors. This similarity measurement exploits the local density information between data points based on the weight of the shared neighbors in a directed (Formula presented.) -nearest neighbor graph with only one parameter (Formula presented.), that is, the number of nearest neighbors. Numerical experiments on synthetic and real-world datasets demonstrate that our proposed algorithm outperforms other existing spectral clustering algorithms in terms of the clustering performance measured via the normalized mutual information, clustering accuracy, and (Formula presented.) -measure. As an example, the proposed method can provide an improvement of 15.82% in the clustering performance for the Soybean dataset. 1225-6463/$ © 2022 ETRI.