Graph Clustering via Cohesiveness-aware Vector Partitioning

Abstract

Graph clustering is one of the key techniques for understanding structures present in the complex graphs such as Web pages, social networks, and others. In the Web and data mining communities, modularity-based graph clustering algorithm is successfully used in many applications. However, it is difficult for the modularity-based methods to find fine-grained clusters hidden in large-scale graphs; the methods fail to reproduce the ground truth. In this paper, we present a novel modularity-based algorithm, CAV-Partitioning, that shows better clustering results than the traditional algorithm. In our proposed method, we introduce cohesiveness-aware vector partitioning into the graph spectral analysis to improve the clustering accuracy. Extensive experiments on public datasets demonstrate the performance superiority of CAV-Partitioning over the state-of-the-art approaches.