中心性
维数(图论)
节点(物理)
计算机科学
复杂网络
学位(音乐)
鉴定(生物学)
图层(电子)
价值(数学)
数据挖掘
理论计算机科学
数学
机器学习
工程类
统计
物理
植物
化学
结构工程
有机化学
万维网
声学
纯数学
生物
作者
Shen Zhong,Haotian Zhang,Yong Deng
标识
DOI:10.1016/j.ins.2022.07.172
摘要
The importance of researches on complex networks is becoming more and more prominent. How to identify influential nodes is still an urgent and crucial issue of many researches on complex networks. Many centrality measures, each has its own emphasis, have been put forward by researchers. Among them, centrality measures based on local properties of nodes are widely used, which assess the importance of nodes based on their degrees. However, they do not take the global information of networks into consideration. In this paper, a Local Degree Dimension (LDD) approach to identify influential nodes in complex networks is proposed. Different from the existing work, LDD regards the numbers of central node’s each layer neighbor nodes as the basis of nodes’ importance calculation. LDD creatively combines the increasing rate and decreasing rate of the numbers of each layer neighbor nodes to obtain its Local Degree Dimension value, which is comprehensive and reasonable. A node with a larger LDD value has a more significant impact on networks. To demonstrate the effectiveness of LDD, six experiments are conducted on six real-world complex networks. Experimental results show that LDD has a higher identification accuracy and a stronger ability to quantify node’s importance.
科研通智能强力驱动
Strongly Powered by AbleSci AI