Journal
SCIENTIFIC REPORTS
Volume 6, Issue -, Pages -Publisher
NATURE PUBLISHING GROUP
DOI: 10.1038/srep22955
Keywords
-
Categories
Funding
- National Natural Science Foundation of China [11222543, 11075031, 11205042, 61433014]
- start-up fund of Hangzhou Normal University [PE13002004039]
- Zhejiang Provincial Natural Science Foundation of China [LR16A050001]
- NCTS in Taiwan
- [MOST 103-2112-M-001-016]
- [104-2112-M-001-002]
Ask authors/readers for more resources
Real network data is often incomplete and noisy, where link prediction algorithms and spurious link identification algorithms can be applied. Thus far, it lacks a general method to transform network organizing mechanisms to link prediction algorithms. Here we use an algorithmic framework where a network's probability is calculated according to a predefined structural Hamiltonian that takes into account the network organizing principles, and a non-observed link is scored by the conditional probability of adding the link to the observed network. Extensive numerical simulations show that the proposed algorithm has remarkably higher accuracy than the state-of-the-art methods in uncovering missing links and identifying spurious links in many complex biological and social networks. Such method also finds applications in exploring the underlying network evolutionary mechanisms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available