A Key Node Mining Method Based on K-Shell and Neighborhood Information

被引:0
作者
Zhao, Na [1 ,2 ]
Feng, Qingchun [1 ]
Wang, Hao [1 ]
Jing, Ming [3 ]
Lin, Zhiyu [1 ]
Wang, Jian [4 ]
机构
[1] Yunnan Univ, Sch Software, Key Lab Software Engn Yunnan Prov, Kunming 650091, Peoples R China
[2] Univ Elect Sci & Technol China, Big Data Res Ctr, Chengdu 610056, Peoples R China
[3] West Yunnan Univ, Sch Artificial Intelligence & Informat Engn, Lincang 677000, Peoples R China
[4] Kunming Univ Sci & Technol, Coll Informat Engn & Automation, Kunming 650504, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2024年 / 14卷 / 14期
基金
中国国家自然科学基金;
关键词
complex networks; K-shell; key nodes; neighborhood information; COMPLEX NETWORKS; INFLUENTIAL SPREADERS; INFLUENCE MAXIMIZATION; STRUCTURAL HOLES; RANKING; IDENTIFICATION; CENTRALITY;
D O I
10.3390/app14146012
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Mining key nodes in complex networks has always been a promising research direction in the field of complex networks. Many precise methods proposed by researchers for mining influential special nodes in networks have been widely applied in a plethora of fields. However, some important node-mining methods often use the degree as a node attribute indicator for evaluating node importance, while the clustering coefficient, as an important attribute of nodes, is rarely utilized. Some methods only consider the global position of nodes in the network while ignoring the local structural information of nodes in special positions and the network. Hence, this paper introduces a novel node centrality method, KCH. The KCH method leverages K-shell to identify the global position of nodes and assists in evaluating the importance of nodes by combining information such as structural holes and local clustering coefficients of first-order neighborhoods. This integrated approach yields an enhanced performance compared to existing methods. We conducted experiments on connectivity, monotonicity, and zero models on 10 networks to evaluate the performance of KCH. The experiments revealed that when compared to the collective influence baseline methods, such as social capital and hierarchical K-shell, the KCH method exhibited superior capabilities in terms of collective influence.
引用
收藏
页数:25
相关论文
共 53 条
  • [1] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [2] Identifying and ranking influential spreaders in complex networks by neighborhood coreness
    Bae, Joonhyun
    Kim, Sangwook
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 : 549 - 559
  • [3] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [4] Batagelj V., 2003, arXiv
  • [5] Complex networks reveal global pattern of extreme-rainfall teleconnections
    Boers, Niklas
    Goswami, Bedartha
    Rheinwalt, Aljoscha
    Bookhagen, Bodo
    Hoskins, Brian
    Kurths, Juergen
    [J]. NATURE, 2019, 566 (7744) : 373 - +
  • [6] The anatomy of a large-scale hypertextual Web search engine
    Brin, S
    Page, L
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 107 - 117
  • [7] Structural holes and good ideas
    Burt, RS
    [J]. AMERICAN JOURNAL OF SOCIOLOGY, 2004, 110 (02) : 349 - 399
  • [8] Identifying influential nodes in complex networks
    Chen, Duanbing
    Lu, Linyuan
    Shang, Ming-Sheng
    Zhang, Yi-Cheng
    Zhou, Tao
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) : 1777 - 1787
  • [9] Characterizing cycle structure in complex networks
    Fan, Tianlong
    Lu, Linyuan
    Shi, Dinghua
    Zhou, Tao
    [J]. COMMUNICATIONS PHYSICS, 2021, 4 (01)
  • [10] CENTRALITY IN SOCIAL NETWORKS CONCEPTUAL CLARIFICATION
    FREEMAN, LC
    [J]. SOCIAL NETWORKS, 1979, 1 (03) : 215 - 239