Spectral graph partitioning is a powerful tool for unsupervised data learning. Most existing algorithms for spectral graph partitioning directly utilize the pairwise similarity matrix of the data to perform graph partitioning. Consequently, they are incapable of fully capturing the intrinsic structural information of graphs. To address this problem, we propose a novel random walk diffusion similarity measure (RWDSM) for capturing the intrinsic structural information of graphs. The RWDSM is composed of three key components - emission, absorbing, and transmission. It is proven that graph partitioning on the RWDSM matrix performs better than on the pairwise similarity matrix of the data. Moreover, a spectral graph partitioning objective function (referred to as DGPC) is used for capturing the discriminant information of graphs. The DGPC is designed to effectively characterize the intra-class compactness and the inter-class separability. Based on the RWDSM and DGPC, we further develop a novel spectral graph partitioning algorithm (referred to as DGPCA). Theoretic analysis and experimental evaluations demonstrate the promise and effectiveness of the developed DGPCA. © Springer-Verlag 2010.
CITATION STYLE
Li, X., Hu, W., Zhang, Z., & Liu, Y. (2010). Spectral graph partitioning based on a random walk diffusion similarity measure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5995 LNCS, pp. 667–676). https://doi.org/10.1007/978-3-642-12304-7_63
Mendeley helps you to discover research relevant for your work.