Graph partitioning is a traditional problem with many applications and a number of high-quality algorithms have been developed. Recently, demand for social network analysis arouses the new research interest on graph partitioning/clustering. Social networks differ from conventional graphs in that they exhibit some key properties like power-law and small-world property. Currently, these features are largely neglected in popular partitioning algorithms. In this paper, we present a novel framework which leverages the small-world property for finding clusters in social networks. The framework consists of several key features. Firstly, we define a total order, which combines the edge weight, the small-world weight, and the hub value, to better reflect the connection strength between two vertices. Secondly, we design a strategy using this ordered list, to greedily, yet effectively, refine existing partitioning algorithms for common objective functions. Thirdly, the proposed method is independent of the original approach, such that it could be integrated with any types of existing graph clustering algorithms. We conduct an extensive performance study on both real-life and synthetic datasets. The empirical results clearly demonstrate that our framework significantly improves the output of the state-of-the-art methods. Furthermore, we show that the proposed method returns clusters with both internal and external higher qualities.
Bibliographical noteFunding Information:
Acknowledgements This research was supported in part by the NSFC Project (61272275, 61070011, 61272110, 61202036, and U1135005), the 111 Project (B07037), the NSFC Overseas, HongKong & Macao Scholars Collaborated Researching Fund (61028003), Specialized Research Fund for the Doctoral Program of Higher Education, China (20090141120050), and the Open Research Fund Program of State Key Laboratory for Novel Software Technology (KFKT2011B24).
- graph partitioning
- network clustering
- small world property