Mining Important Nodes in Directed Weighted Complex Networks
Mining Important Nodes in Directed Weighted Complex Networks
复制标题
挖掘有向加权复杂网络中的重要节点
DOI：
10.1155/2017/9741824
复制
发表时间：
2017
影响因子：
1.4
通讯作者：
Xie Jun
中科院分区：
文献类型：
--
作者：
Yang Yunyun;Xie Gang;Xie Jun
在复杂网络中，挖掘重要节点一直是学者们关注的问题。近年来，学者们重点关注无向无权复杂网络中重要节点的挖掘。但大多数方法不适用于有向加权复杂网络。因此，本文提出一种基于PageRank的Two-Way-PageRank方法，以进一步讨论有向加权复杂网络中重要节点的挖掘。我们主要考虑了节点之间接触的频率和节点之间接触的时间长度。我们同时考虑了节点的来源（入度）和节点的去向（出度）。我们给了节点重要的性能指标。通过数值算例，分析了一些参数的变化对节点重要性能指标的影响。最后，论文通过实证网络数据验证了该方法的准确性和有效性。
In complex networks, mining important nodes has been a matter of concern by scholars. In recent years, scholars have focused on mining important nodes in undirected unweighted complex networks. But most of the methods are not applicable to directed weighted complex networks. Therefore, this paper proposes a Two-Way-PageRank method based on PageRank for further discussion of mining important nodes in directed weighted complex networks. We have mainly considered the frequency of contact between nodes and the length of time of contact between nodes. We have considered the source of the nodes (in-degree) and the whereabouts of the nodes (out-degree) simultaneously. We have given node important performance indicators. Through numerical examples, we analyze the impact of variation of some parameters on node important performance indicators. Finally, the paper has verified the accuracy and validity of the method through empirical network data.
登录
查看更多内容
影响因子：
2.4
作者：
P. Ekins
通讯作者：
P. Ekins
影响因子：
1.9
作者：
F. Blattner
通讯作者：
F. Blattner
影响因子：
1.6
作者：
Vicki D Crinis
通讯作者：
Vicki D Crinis
影响因子：
0.2
作者：
R. Eglash
通讯作者：
R. Eglash
DOI：
10.1080/13573320701467344
发表时间：
2004-01
期刊：
Wiley-Blackwell: Development Policy Review
影响因子：
--
作者：
J. Roberts;D. Shaw;P. Sahoo;N. Harris;B. Persaud;M. Thakur;I. Gillson;A. Suleiman
通讯作者：
J. Roberts;D. Shaw;P. Sahoo;N. Harris;B. Persaud;M. Thakur;I. Gillson;A. Suleiman