Community Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks

• Main Authors: M. Zarezade, E. Nourani, Asgarali Bouyer
• Format: Article
• Language: English
• Published: Shahrood University of Technology 2020-04-01
• Series: Journal of Artificial Intelligence and Data Mining
• Subjects: social networks; community detection; boundary node; label propagation
• Online Access: http://jad.shahroodut.ac.ir/article_1665_1f4f0ce5993e9bcaff5246231da51035.pdf
• ISSN: 2322-5211; 2322-4444

Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as instability, low accuracy, randomness, etc. The G-CN algorithm is one of local methods that uses the same label propagation as the LPA method, but unlike the LPA, only the labels of boundary nodes are updated at each iteration that reduces its execution time. However, it has resolution limit and low accuracy problem. To overcome these problems, this paper proposes an improved community detection method called SD-GCN which uses a hybrid node scoring and synchronous label updating of boundary nodes, along with disabling random label updating in initial updates. In the first phase, it updates the label of boundary nodes in a synchronous manner using the obtained score based on degree centrality and common neighbor measures. In addition, we defined a new method for merging communities in second phase which is faster than modularity-based methods. Extensive set of experiments are conducted to evaluate performance of the SD-GCN on small and large-scale real-world networks and artificial networks. These experiments verify significant improvement in the accuracy and stability of community detection approaches in parallel with shorter execution time in a linear time complexity.