节点文献
基于k-shell熵的影响力节点的排序与识别
Ranking and Recognition of Influential Nodes Based on k-shell Entropy
【摘要】 节点的影响力排序一直是复杂网络领域中最具有吸引力的一个问题,其对于衡量节点的传播能力有着重要的作用。由于网络中的节点的规模很大,研究者们希望能够更准确地估计节点的传播能力。文中基于信息论的基本概念和k-shell方法提出了一种新的影响力节点的排序方法,根据节点所在网络中的位置的拓扑信息来测量节点的传播能力。实验结果表明,该方法可以有效地识别网络中有影响力的节点,并且可以有效避免k-shell法的“富人俱乐部现象”。
【Abstract】 The spreading capacity of nodes has been one of the most attractive problems in the field of complex networks.Due to the large size of nodes in network,researchers want to find accurate measures to estimate the spreading capacity of nodes.In this paper,a new method is proposed based on the basic concepts of information theory and k-shell,which measures the spreading capacity of nodes according to the topological information of their locations in the network.Experimental results show that the proposed method is more effective than other similar methods,and can effectively avoid the“rich club phenomenon”of k-shell method.
【Key words】 Complex network; Influential node; k-shell entropy; Information spreading;
- 【文献出处】 计算机科学 ,Computer Science , 编辑部邮箱 ,2022年S2期
- 【分类号】O157.5
- 【下载频次】61