STC plus K: a Semi-global triangular and degree centrality method to identify influential spreaders in complex networks

被引:2
作者
Sadhu, Srestha [1 ]
Namtirtha, Amrita [2 ]
Malta, Mariana Curado [3 ,4 ]
Dutta, Animesh [1 ]
机构
[1] Natl Inst Technol Durgapur, Comp Sci & Engn, Durgapur, India
[2] JIS Coll Engn, Comp Sci & Engn, Kalyani, India
[3] Polytech Porto, CEOS PP, Porto, Portugal
[4] Univ Minho, ALGORITMI Ctr, LASI, Braga, Portugal
来源
2023 IEEE INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WI-IAT | 2023年
关键词
Complex networks; Influential spreaders; Degree centrality; Semi-global triangular Centrality; INDEX; IDENTIFICATION; DYNAMICS;
D O I
10.1109/WI-IAT59888.2023.00107
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Influential spreaders contribute substantially to managing and optimizing any spreading process in a network. Influential spreaders are nodes that hold importance within the network. Identifying them is a challenging task. Some encysting methods for such identification include local-structure-based, global-structure-based, semi-global-structure-based, and hybrid-structure-based methods. Semi-global structure-based methods show significant potential in identifying influential nodes in different network structures. However, existing semi-global structure-based methods often identify nodes from the network's periphery, where nodes are loosely connected, and their collective influence in spreading processes is minimal. This paper presents a novel method called Semi-global triangular and degree centrality (STC + K) to overcome this limitation by considering a node's degree, the number of triangles, and the third hop of neighbourhood connectivity information. The proposed novel method outperforms the existing noteworthy indexing methods regarding ranking performance. The experimental results show better performance, as indicated by two performance metrics: recognition rate and improvement percentage. By virtue of the fact that the empirically set free parameters are absent, our method eliminates the need for time-consuming preprocessing to select optimal parameter values for ranking nodes in large networks.
引用
收藏
页码:655 / 662
页数:8
相关论文
共 45 条
[1]   Using metrics from complex networks to evaluate machine translation [J].
Amancio, D. R. ;
Nunes, M. G. V. ;
Oliveira, O. N., Jr. ;
Pardo, T. A. S. ;
Antiqueira, L. ;
Costa, L. da F. .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2011, 390 (01) :131-142
[2]   Identifying and ranking influential spreaders in complex networks by neighborhood coreness [J].
Bae, Joonhyun ;
Kim, Sangwook .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 :549-559
[3]   Characterization and modeling of weighted networks [J].
Barthélemy, M ;
Barrat, A ;
Pastor-Satorras, R ;
Vespignani, A .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2005, 346 (1-2) :34-43
[4]  
Bastian M., 2009, INT AAAI C WEBL SOC, DOI [10.1609/icwsm.v3i1.13937, DOI 10.1609/ICWSM.V3I1.13937]
[5]  
Batagelj Vladimir, Networks-datasets and software
[6]   Eigenvector-like measures of centrality for asymmetric relations [J].
Bonacich, P ;
Lloyd, P .
SOCIAL NETWORKS, 2001, 23 (03) :191-201
[7]   Thresholds for Epidemic Spreading in Networks [J].
Castellano, Claudio ;
Pastor-Satorras, Romualdo .
PHYSICAL REVIEW LETTERS, 2010, 105 (21)
[8]   Identifying influential nodes in complex networks [J].
Chen, Duanbing ;
Lu, Linyuan ;
Shang, Ming-Sheng ;
Zhang, Yi-Cheng ;
Zhou, Tao .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) :1777-1787
[9]   SET OF MEASURES OF CENTRALITY BASED ON BETWEENNESS [J].
FREEMAN, LC .
SOCIOMETRY, 1977, 40 (01) :35-41
[10]  
Hagberg Aric, 2021, Software, version 2.6.2.