Kernel Spectral Clustering for Big Data Networks
AbstractThis paper shows the feasibility of utilizing the Kernel Spectral Clustering (KSC) method for the purpose of community detection in big data networks. KSC employs a primal-dual framework to construct a model. It results in a powerful property of effectively inferring the community affiliation for out-of-sample extensions. The original large kernel matrix cannot fitinto memory. Therefore, we select a smaller subgraph that preserves the overall community structure to construct the model. It makes use of the out-of-sample extension property for community membership of the unseen nodes. We provide a novel memory- and computationally efficient model selection procedure based on angular similarity in the eigenspace. We demonstrate the effectiveness of KSC on large scale synthetic networks and real world networks like the YouTube network, a road network of California and the Livejournal network. These networks contain millions of nodes and several million edges. View Full-Text
Share & Cite This Article
Mall, R.; Langone, R.; Suykens, J.A. Kernel Spectral Clustering for Big Data Networks. Entropy 2013, 15, 1567-1586.
Mall R, Langone R, Suykens JA. Kernel Spectral Clustering for Big Data Networks. Entropy. 2013; 15(5):1567-1586.Chicago/Turabian Style
Mall, Raghvendra; Langone, Rocco; Suykens, Johan A. 2013. "Kernel Spectral Clustering for Big Data Networks." Entropy 15, no. 5: 1567-1586.