4.6 Review

Link prediction in complex networks: A survey

期刊

出版社

ELSEVIER
DOI: 10.1016/j.physa.2010.11.027

关键词

Link prediction; Complex networks; Node similarity; Maximum likelihood methods; Probabilistic models

资金

  1. National Natural Science Foundation of China [11075031, 10635040]
  2. Swiss National Science Foundation [200020-121848]
  3. Shanghai leading discipline project [S30501]

向作者/读者索取更多资源

Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving mechanisms, and so on. This article summaries recent progress about link prediction algorithms, emphasizing on the contributions from physical perspectives and approaches, such as the random-walk-based methods and the maximum likelihood methods. We also introduce three typical applications: reconstruction of networks, evaluation of network evolving mechanism and classification of partially labeled networks. Finally, we introduce some applications and outline future challenges of link prediction algorithms. (C) 2010 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据