An adaptive granulation algorithm for community detection based on improved label propagation

Abstract Community detection is a hot research in complex network analysis. Detecting community structure in networks is crucial for insight into the internal connections within networks. A variety of algorithms have previously been proposed, while few of them can efficiently apply to large-scale networks due to unacceptable running time and intractable parameter tuning. To tackle the above issues, this paper proposes an adaptive granulation algorithm for community detection based on improved label propagation (Gr-ILP), which granulates a network hierarchically with the improved label propagation strategy. For a given network, first, an improved label propagation strategy (ILP) is adopted to gather similar nodes into non-overlapping collections which consist of nodes with high similarity. Second, each collection detected in first step is granulated into a super node, and the edges between two collections are granulated into a super edge. After this granulation processing, a super-network that is coarser and smaller than the original one is formed. Then, the above two steps are repeated iteratively until it stops forming new collections in the first step. Due to the adoption of an adaptive strategy, the proposed Gr-ILP algorithm granulates the network to a certain layer which saves much time when processing large-scale networks. Finally, Gr-ILP assigns unallocated and isolated nodes to the appropriate community. The proposed algorithm requires neither any priori information of communities nor adjustment of any parameters and still can obtained satisfactory community structure adaptively. Gr-ILP tends to preserve small-scale communities by limiting the growth of node collections. Moreover, because of the sharp decline in network size by the granulation process, the algorithm consumes less time and is suitable for large-scale networks. Experimental results on eight real-world network datasets of different types and sizes demonstrate the effectiveness and efficiency of our algorithm, compared with several other baseline algorithms.

[1]  Linyuan Lü,et al.  Predicting missing links via local information , 2009, 0901.0553.

[2]  Pramod K. Varshney,et al.  Communication Network Topology Inference via Transfer Entropy , 2020, IEEE Transactions on Network Science and Engineering.

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

[4]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[5]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[6]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[7]  Junming Shao,et al.  Community Detection based on Distance Dynamics , 2015, KDD.

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

[9]  Jiajun Ding,et al.  Community detection by propagating the label of center , 2018, Physica A: Statistical Mechanics and its Applications.

[10]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

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

[12]  Lin Mu,et al.  Intelligent mining on purchase information and recommendation system for e-commerce , 2015, 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM).

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

[14]  Piotr Honko,et al.  Properties of a Granular Computing Framework for Mining Relational Data , 2017, Int. J. Intell. Syst..

[15]  Andrzej Piegat,et al.  Solving different practical granular problems under the same system of equations , 2018 .

[16]  Jiming Liu,et al.  Discovering global network communities based on local centralities , 2008, TWEB.

[17]  Javier Montero,et al.  A new modularity measure for Fuzzy Community detection problems based on overlap and grouping functions , 2016, Int. J. Approx. Reason..

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

[19]  Anastasia Baryshnikova,et al.  Spatial Analysis of Functional Enrichment (SAFE) in Large Biological Networks , 2016, bioRxiv.

[20]  Naomi Ehrich Leonard,et al.  Information Centrality and Ordering of Nodes for Accuracy in Noisy Decision-Making Networks , 2016, IEEE Transactions on Automatic Control.

[21]  Jianpei Zhang,et al.  A robust two-stage algorithm for local community detection , 2018, Knowl. Based Syst..

[22]  Yangyang Li,et al.  Large-scale community detection based on node membership grade and sub-communities integration , 2015, Physica A: Statistical Mechanics and its Applications.

[23]  Witold Pedrycz,et al.  Granular Computing: Perspectives and Challenges , 2013, IEEE Transactions on Cybernetics.

[24]  Yicheng Zhang,et al.  Effects of high-order correlations on personalized recommendations for bipartite networks , 2010 .

[25]  Fu-Ling Yang,et al.  A new image processing algorithm for three-dimensional angular velocity measurement and its application in a granular avalanche , 2018 .

[26]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

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

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

[29]  Olaf Sporns,et al.  Complex network measures of brain connectivity: Uses and interpretations , 2010, NeuroImage.

[30]  Guido Caldarelli,et al.  Networks of plants: how to measure similarity in vegetable species , 2016, Scientific Reports.

[31]  Quan Pan,et al.  SELP: Semi-supervised evidential label propagation algorithm for graph data clustering , 2018, Int. J. Approx. Reason..

[32]  Andrzej Skowron,et al.  Data science, big data and granular mining , 2015, Pattern Recognit. Lett..

[33]  Wen-Lung Shiau,et al.  Methodological research on partial least squares structural equation modeling (PLS-SEM) , 2019, Internet Res..

[34]  Jie Chen,et al.  Relational granulation method based on Quotient Space Theory for maximum flow problem , 2020, Inf. Sci..

[35]  Yasushi Kawase,et al.  Z-Score-Based Modularity for Community Detection in Networks , 2015, PloS one.

[36]  Caixia Liu,et al.  Extended resource allocation index for link prediction of complex network , 2017 .

[37]  Martin G. Everett,et al.  Analyzing social networks , 2013 .

[38]  Wei Li,et al.  Multi-resolution community detection in massive networks , 2016, Scientific Reports.

[39]  S. Dongen.  A cluster algorithm for graphs , 2000 .

[40]  Siddique Latif,et al.  Community detection in networks: A multidisciplinary review , 2018, J. Netw. Comput. Appl..

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

[42]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[43]  Liu Ren,et al.  The Granular Theorem of Quotient Space in Image Segmentation , 2005 .

[44]  Anton J. Enright,et al.  Network visualization and analysis of gene expression data using BioLayout Express3D , 2009, Nature Protocols.

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

[46]  Massimo Marchiori,et al.  Method to find community structures based on information centrality. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[47]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[48]  Liu Jian-guo.  Effects of User Tastes on Personalized Recommendation , 2010 .

[49]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

[50]  Jiawei Han,et al.  Density-based shrinkage for revealing hierarchical and overlapping community structure in networks , 2011 .

[51]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[52]  Ling Zhang,et al.  Hierarchical description of uncertain information , 2014, Inf. Sci..

[53]  Mauro Conti,et al.  The Dark Side(-Channel) of Mobile Devices: A Survey on Network Traffic Analysis , 2017, IEEE Communications Surveys & Tutorials.

[54]  Cun-Quan Zhang,et al.  Eb&D: A new clustering approach for signed social networks based on both edge-betweenness centrality and density of subgraphs , 2017 .