Link prediction in complex networks: A survey
Reads0
Chats0
TLDR
Recent progress about link prediction algorithms is summarized, emphasizing on the contributions from physical perspectives and approaches, such as the random-walk-based methods and the maximum likelihood methods.Abstract:
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.read more
Citations
More filters
Journal ArticleDOI
Effective strategy of adding links for improving network transport efficiency on complex networks
TL;DR: Simulation results show that the proposed strategy to enhance the network transport efficiency by adding links to the existing networks can bring better traffic capacity and shorter average shortest path length than the low-degree-first (LDF) strategy and theLow-betweenness- first (LBF) strategy.
Journal ArticleDOI
Locating the propagation source on complex networks with Propagation Centrality algorithm
TL;DR: A novel Propagation Centrality (PC) algorithm is proposed, which could locate the propagation source on arbitrary graph with complexity O(N3) and shows that PC performs better than other 5 existing methods.
Journal ArticleDOI
The sensitivity of network statistics to incomplete electrode sampling on intracranial EEG.
Erin C. Conrad,John M. Bernabei,Lohith G. Kini,Preya Shah,Fadi Mikhail,Fadi Mikhail,Ammar Kheder,Russell T. Shinohara,Kathryn A. Davis,Kathryn A. Davis,Danielle S. Bassett,Brian Litt +11 more
TL;DR: An algorithm using random subsampling to compute patient-specific confidence intervals for network localizations is presented as an important step toward translating personalized network models of seizures into rigorous, quantitative approaches to invasive therapy.
Journal ArticleDOI
A local random walk model for complex networks based on discriminative feature combinations
TL;DR: Experimental results on real-life complex network datasets demonstrate that, compared to other baseline methods, using discriminative feature combinations and topology structures in tandem strengthens prediction performance remarkably.
Proceedings ArticleDOI
Scaling up Link Prediction with Ensembles
TL;DR: This paper proposes an ensemble enabled approach to scaling up link prediction, which is able to decompose traditional link prediction problems into subproblems of smaller size, and shows the advantage of using ensemble-based latent factor models with experiments on very large networks.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Journal ArticleDOI
The meaning and use of the area under a receiver operating characteristic (ROC) curve.
TL;DR: A representation and interpretation of the area under a receiver operating characteristic (ROC) curve obtained by the "rating" method, or by mathematical predictions based on patient characteristics, is presented and it is shown that in such a setting the area represents the probability that a randomly chosen diseased subject is (correctly) rated or ranked with greater suspicion than a random chosen non-diseased subject.
Journal ArticleDOI
Statistical mechanics of complex networks
TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.