PLDLS: A novel parallel label diffusion and label Selection-based community detection algorithm based on Spark in social networks

被引:23
作者
Roghani, Hamid [1 ]
Bouyer, Asgarali [1 ]
Nourani, Esmaeil [1 ]
机构
[1] Azarbaijan Shahid Madani Univ, Dept Comp Engn, Tabriz, Iran
关键词
Parallel community detection; Label diffusion; Local similarity; Label selection; Spark; Social networks; COMPLEX NETWORKS; PROPAGATION ALGORITHM; LOCAL SIMILARITY; MODULARITY; NODES; ORGANIZATION; GRAPH;
D O I
10.1016/j.eswa.2021.115377
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Parallel and distributed community detection in large-scale complex networks, such as social networks, is a challenging task. Parallel and distributed algorithm with high accuracy and low computational complexity is one of the essential issues in the community detection field. In this paper, we propose a novel fast, and accurate Spark-based parallel label diffusion and label selection-based (PLDLS) community detection algorithm with twostep of label diffusion of core nodes along with a new label selection (propagation) method. We have used multi factor criteria for computing node's importance and adopted a new method for selecting core nodes. In the first phase, utilizing the fact that nodes forming triangles, tend to be in the same community, parallel label diffusion of core nodes is performed to diffuse labels up to two levels. In the second phase, through an iterative and parallel process, the most appropriate labels are assigned to the remaining nodes. PLDLS proposes an improved robust version of LPA by putting aside randomness parameter tuning. Furthermore, we utilize a fast and parallel merge phase to get even more dense and accurate communities. Conducted experiments on real-world and artificial networks, indicates the better accuracy and low execution time of PLDLS in comparison with other examined methods.
引用
收藏
页数:24
相关论文
共 95 条
  • [1] A three-stage algorithm for local community detection based on the high node importance ranking in social networks
    Aghaalizadeh, Saeid
    Afshord, Saeid Taghavi
    Bouyer, Asgarali
    Anari, Babak
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2021, 563
  • [2] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [3] [Anonymous], 2007, ACM T WEB, DOI [DOI 10.1145/1232722.1232727, 10.1145/1217299.1217301]
  • [4] [Anonymous], 2004, PHYS REV E, DOI DOI 10.1103/PHYSREVE.69.066133
  • [5] [Anonymous], 2007, TEACH TUTOR MAT
  • [6] [Anonymous], 2011, KD11 17 ACM SIGKDD I
  • [7] Community Detection in Complex Networks by Detecting and Expanding Core Nodes Through Extended Local Similarity of Nodes
    Berahman, Kamal
    Bouyer, Asgarali
    Vasighi, Mandi
    [J]. IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2018, 5 (04): : 1021 - 1033
  • [8] Triadic closure as a basic generating mechanism of communities in complex networks
    Bianconi, Ginestra
    Darst, Richard K.
    Iacovacci, Jacopo
    Fortunato, Santo
    [J]. PHYSICAL REVIEW E, 2014, 90 (04)
  • [9] Fast unfolding of communities in large networks
    Blondel, Vincent D.
    Guillaume, Jean-Loup
    Lambiotte, Renaud
    Lefebvre, Etienne
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
  • [10] Models of social networks based on social distance attachment -: art. no. 056122
    Boguñá, M
    Pastor-Satorras, R
    Díaz-Guilera, A
    Arenas, A
    [J]. PHYSICAL REVIEW E, 2004, 70 (05) : 8 - 1