LB-SAM: Local Beam Search With Simulated Annealing for Community Detection in Large-Scale Social Networks

被引:1
作者
Nath, Keshab [1 ]
Sharma, Rupam Kumar [2 ]
Hassan, Sk Mahmudul [3 ]
机构
[1] Bhattadev Univ, Dept Comp Sci & Engn, Bajali 781325, Pathsala, India
[2] Rajiv Gandhi Univ, Dept Comp Sci & Engn, Doimukh 791112, Arunachal Prade, India
[3] Manipal Acad Higher Educ, Manipal Inst Technol Bengaluru, Dept Informat Technol, Manipal 576104, Karnataka, India
关键词
Local beam search; simulated annealing; modularity; local intrinsic density; community detection; online social networks; COMPLEX NETWORKS;
D O I
10.1109/ACCESS.2024.3497216
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the rapid development of internet technologies and the increasing availability of large-scale data, the detection of community structures within complex networks has become a critical area of research. This paper introduces a novel community detection technique called LB-SAM (Local Beam Search with Simulated Annealing and Modularity), designed to efficiently uncover hidden community structures in large-scale social networks. LB-SAM integrates Local Beam Search (LBS) to explore the local network structure and Simulated Annealing (SA) to globally optimize modularity, enabling the detection of communities with intricate boundaries and strong internal connections. By focusing on influential nodes to form subgroups and recursively merging them based on modularity, LB-SAM provides superior scalability and robustness in both real-world and synthetic networks. Extensive experiments conducted on 12 real-world and 6 synthetic datasets demonstrate that LB-SAM consistently outperforms existing state-of-the-art algorithms, particularly in networks with unclear community structures, and scales effectively to billion-scale networks. The proposed method has wide-ranging applications in sociology, biology, marketing, and cybersecurity, offering valuable insights into the structure and dynamics of large social networks.
引用
收藏
页码:167705 / 167723
页数:19
相关论文
共 78 条
[1]  
Aggarwal CC, 2010, ADV DATABASE SYST, V40, P1, DOI 10.1007/978-1-4419-6045-0
[2]   SAG Cluster: An unsupervised graph clustering based on collaborative similarity for community detection in complex networks [J].
Agrawal, Smita ;
Patel, Atul .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2021, 563
[3]   A new scalable leader-community detection approach for community detection in social networks [J].
Ahajjam, Sara ;
El Haddad, Mohamed ;
Badir, Hassan .
SOCIAL NETWORKS, 2018, 54 :41-49
[4]  
Aston N., 2014, Journal of Software Engineering and Applications, V7, P872, DOI 10.4236/jsea.2014.710078
[5]   Community Detection in Complex Networks by Detecting and Expanding Core Nodes Through Extended Local Similarity of Nodes [J].
Berahman, Kamal ;
Bouyer, Asgarali ;
Vasighi, Mandi .
IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2018, 5 (04) :1021-1033
[6]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[7]  
Brandes U, 2006, Arxiv, DOI arXiv:physics/0608255
[8]   Identifying overlapping communities as well as hubs and outliers via nonnegative matrix factorization [J].
Cao, Xiaochun ;
Wang, Xiao ;
Jin, Di ;
Cao, Yixin ;
He, Dongxiao .
SCIENTIFIC REPORTS, 2013, 3
[9]  
Chang PC, 2013, PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON THE MODERN DEVELOPMENT OF HUMANITIES AND SOCIAL SCIENCE, P25
[10]   Core expansion: a new community detection algorithm based on neighborhood overlap [J].
Choumane, Ali ;
Awada, Ali ;
Harkous, Ali .
SOCIAL NETWORK ANALYSIS AND MINING, 2020, 10 (01)