arrow
返回

Link prediction of time-evolving network based on node ranking

delete2020-05-01
delete31
PRE
AI
X
Xiaomin Wu
J
Jianshe Wu *
Y
Yafeng Li
Q
Qian Zhang
DOI:10.1016/j.knosys.2020.105740delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Many real-world networks belong to the kind that evolves over time. So it is very meaningful and challenging to predict whether the link will occur in the network of future time. In this paper, both time-evolving scale-free (SF) network and real-world dynamic network are taken into consideration first and then two kinds of methods are respectively proposed for link prediction. Different from many existing similarity-based dynamic network link prediction methods, many of which adopt node-pair similarity such as common neighbors (CN), Adamic-Adar (AA), and so on, we measure the similarity between nodes from a new perspective. With further research into node ranking, some eigenvector-based methods, such as PageRank (PR), Cumulative Nomination (CuN) and so on, can compute the values of node importance which can be regarded as the stationary distribution of Markov chain for all nodes iteratively. Therefore, from a statistical point of view, the importance of a node is like the probability of attracting other nodes to connect with it and the derivative value of a node pair is like the probability of attracting each other. These node-ranking-based approaches are very novel in the field of link prediction in that few researches have paid enough attention to them before. In addition, an adaptively time series forecasting method is proposed in this paper, and it uses the historical similarity series to predict the future similarity between each node pair adaptively. Experimental results show that our proposed algorithms can predict the future links not only for the growing SF network but also for the dynamic networks in the real-world. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Dynamic network
Time-evolving SF network
Node ranking
Link prediction
Time series forecasting
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

X
Xidian University
学者数:
2.4W
论文数: 1.9W
被引数: 9.7K
引用论文

引用论文

err分享
err收藏
Link prediction in dynamic networks based on the attraction force between nodes
err2019-10-01
err30
PREAI
errChi, Kuo; Yin, Guisheng; Dong, Yuxin; Dong, Hongbin
err分享
err收藏
Biologically Inspired Soft Robot for Thumb Rehabilitation1
err2014-04-28
err0
PREAI
errPaxton Maeder-York; Tyler Clites; Emily Boggs; Ryan Neff; Panagiotis Polygerinos; Dónal Holland; Leia Stirling; Kevin Galloway; Catherine Wee; Conor Walsh
err分享
err收藏
学者 查看更多内容