计算机与现代化Issue(3)：115-121,7.DOI:10.3969/j.issn.1006-2475.2024.03.019
基于共同邻居数的重要节点发现算法
Identifying Influential Nodes in Large-scale Networks Based on Neighbor Classification
摘要
Abstract
Identifying important nodes has always been one of the hot problems under complex networks,because the identified important nodes can play an important role in information dissemination or disease immunization in the population.The research of large number of current methods is basically based on three perspectives:node's neighbor information,shortest path in the network and node deletion.The existing approaches based on the node's neighbor information do not provide a specific descrip-tion of the role of neighboring nodes and do not differentiate the contributions of neighboring nodes in different dimensions.This paper proposes a SCCN method,this method divides the contribution of neighbor nodes into two parts:strengthening the propaga-tion effect within the tightly connected local area where the node is located and extending the information carried by the node to other areas of the network.The performance of SCCN is evaluated by the standard SIR model and compared with degree central-ity,K-shell,meso-centrality and PageRank on eight real networks.The experimental results show that SCCN has higher accu-racy and stability,as well as lower time complexity,and can be applied to large-scale networks.关键词
排序算法/大规模网络/共同邻居数/SIR模型Key words
ranking algorithm/large-scale network/common neighbors/SIR model分类
信息技术与安全科学引用本文复制引用
盛家烨..基于共同邻居数的重要节点发现算法[J].计算机与现代化,2024,(3):115-121,7.基金项目
黑龙江省归国人员科学基金资助项目(LC2018031) （LC2018031）
哈尔滨工业大学跨学科发展计划(SYL-JC-202203) （SYL-JC-202203）
