Predicting missing links and identifying spurious links via likelihood analysis

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 net...

Full description

Saved in:
Bibliographic Details
Published inScientific reports Vol. 6; no. 1; p. 22955
Main Authors Pan, Liming, Zhou, Tao, Lü, Linyuan, Hu, Chin-Kun
Format Journal Article
LanguageEnglish
Published London Nature Publishing Group UK 10.03.2016
Nature Publishing Group
Subjects
Online AccessGet full text
ISSN2045-2322
2045-2322
DOI10.1038/srep22955

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2045-2322
2045-2322
DOI:10.1038/srep22955