.png){kind=icon}
返回
Link prediction based on sampling in complex networks
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-016-0872-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The link prediction problem has received extensive attention in fields such as sociology, anthropology, information science, and computer science. In many practical applications, we only need to predict the potential links between the vertices of interest, instead of predicting all of the links in a complex network. In this paper, we propose a fast similarity based approach for predicting the links related to a given node. We construct a path set connected to the given node by a random walk. The similarity score is computed within a small sub-graph formed by the path set connected to the given node, which significantly reduces the computation time. By choosing the appropriate number of sampled paths, we can restrict the error of the estimated similarities within a given threshold. Our experimental results on a number of real networks indicate that the algorithm proposed in this paper can obtain accurate results in less time than existing methods.
Keyword:
Link prediction
Vertex similarity
Similarity error
Sub-graph
Complex networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Vogt-Koyanagi-Harada syndrome: A novel case and brief review of focal neurologic presentationsVogt-Koyanagi-Harada综合征：一个新型病例及其局灶性神经病学表现的简要综述
OAAI
OAAI分享收藏Using Mobile Technologies to Enhance Accessibility and Inclusion in Field-Based Learning.png)
GSA Today
OAAI
GSA TodayIF0
OAAI分享收藏
查看更多内容