Abstract:
|
We proposed a novel collaborative spectral clustering algorithm for attributed networks, where assuming n nodes splitting into R non-overlapping communities and each node has a p-dimensional meta covariate. The connectivity matrix W is constructed with the structural adjacent matrix A and the covariate matrix X, where W = (1 ? ?)A + ?K(X, X?), ? ? [0, 1] is a tuning parameter to balance between structural and covariate information, while K is a Kernel function, i.e., a similarity function over pairs of nodes in the covariate matrix. We then perform the classical k?means clustering algorithm on the element-wise ratio matrix of the first R leading eigenvectors of W. Both theoretical and simulation studies showed the consistent performance under Stochastic Block Model (SBM), especially in imbalanced networks where most community detection algorithms fail.
|