A Divisive Hierarchical Structural Clustering Algorithm for Networks

Many systems in sciences, engineering and nature can be modeled as networks. Examples are internet, metabolic networks and social networks. Network clustering algorithms aimed to find hidden structures from networks are important to make sense of complex networked data. In this paper we present a new clustering method for networks. The proposed algorithm can find hierarchical structure of clusters without requiring any input parameters. The experiments using real data demonstrate an outstanding performance of the new method.

[1]  Chris H. Q. Ding,et al.  A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[2]  Xiaowei Xu,et al.  SCAN: a structural clustering algorithm for networks , 2007, KDD '07.

[3]  Xiaowei Xu,et al.  A Novel Similarity-Based Modularity Function for Graph Partitioning , 2007, DaWaK.

[4]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[5]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[6]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.