Hierarchical Clustering Based on Hyper-edge Similarity for Community Detection

Community structure is very important for many real-world networks. It has been shown that communities are overlapping and hierarchical. However, most previous methods, based on the graph model, can't investigate these two properties of community structure simultaneously. Moreover, in some cases the use of simple graphs does not provide a complete description of the real-world network. After introducing hyper graphs to describe real-world networks and defining hyper-edge similarity measurement, we propose a Hierarchical Clustering method based on Hyper-edge Similarity (HCHS) to simultaneously detect both the overlapping and hierarchical properties of complex community structure, as well as using the newly introduced community density to evaluate the goodness of a community. The examples of application to real-world networks give excellent results.

[1]  Roger Guimerà,et al.  Extracting the hierarchical organization of complex systems , 2007, Proceedings of the National Academy of Sciences.

[2]  Igor Gazdík,et al.  Modelling systems by hypergraphs , 2006 .

[3]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[4]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Steve Gregory,et al.  Finding Overlapping Communities Using Disjoint Community Detection Algorithms , 2009, CompleNet.

[7]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality and clustering in complex hyper-networks , 2006 .

[8]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[9]  T. Vicsek,et al.  Weighted network modules , 2007, cond-mat/0703706.

[10]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[11]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[12]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[13]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[14]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  T. Vicsek,et al.  Directed network modules , 2007, physics/0703248.

[16]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[17]  Mao-Bin Hu,et al.  Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.

[18]  Steve Gregory,et al.  An Algorithm to Find Overlapping Community Structure in Networks , 2007, PKDD.

[19]  A. Bonato,et al.  Graphs and Hypergraphs , 2022 .

[20]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[21]  Jean-Loup Guillaume,et al.  Fast unfolding of community hierarchies in large networks , 2008, ArXiv.