CLOSE: Local Community Detection by LOcal Structure Expansion in a Complex Network

There have been more and more researches on community discovery in complex networks. Expanding of a source node into a community is one of the most successful methods for local community detection, especially when the global structure of the network is not accessible. In this paper, we propose CLOSE algorithm, Local Community Detection by LOcal Structure Expansion, based on the local expansion technique in the community detection. In CLOSE, we propose a novel connective function to identify a better source node. The node is in the center of a highly connected component of a graph. CLOSE selects a group of nodes instead of a single node to be the seed for the expansion of a local community. In addition, using the neighboring group can identify a suitable community for a hub node. Moreover, the expansion strategy is based on the label propagation technique instead of local community measurements. In experiments, we compare the performance of CLOSE with previous methods both on synthetic networks from the LFR Benchmark and real-world networks. We also examine the merit of the source node selection strategy. Both source node selection and community detection in CLOSE outperform previous algorithms.

[1]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  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.

[4]  Charalampos E. Tsourakakis,et al.  Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees , 2013, KDD.

[5]  Shen Bing,et al.  A local complex network communities' discovery algorithm , 2013, 2013 IEEE 4th International Conference on Software Engineering and Service Science.

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

[7]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[8]  Jure Leskovec,et al.  Defining and Evaluating Network Communities Based on Ground-Truth , 2012, ICDM.

[9]  Duanbing Chen,et al.  An Efficient Algorithm for Overlapping Community Detection in Complex Networks , 2009, 2009 WRI Global Congress on Intelligent Systems.

[10]  Inderjit S. Dhillon,et al.  Overlapping community detection using seed set expansion , 2013, CIKM.

[11]  Ali Hamzeh,et al.  A heuristic local community detection method (HLCD) , 2016, Applied Intelligence.

[12]  Rushed Kanawati,et al.  Community detection in social networks: The power of ensemble methods , 2014, 2014 International Conference on Data Science and Advanced Analytics (DSAA).

[13]  Lili Zhang,et al.  An Efficient Hierarchy Algorithm for Community Detection in Complex Networks , 2014 .

[14]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Tomas Olovsson,et al.  A local seed selection algorithm for overlapping community detection , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[16]  Randy Goebel,et al.  Local Community Identification in Social Networks , 2009, 2009 International Conference on Advances in Social Network Analysis and Mining.

[17]  Bin Wu,et al.  A Method for Local Community Detection by Finding Core Nodes , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[18]  Ranran Zhou,et al.  Local Community Detection Algorithm Based on Minimal Cluster , 2016, Appl. Comput. Intell. Soft Comput..