scispace - formally typeset
Open AccessJournal ArticleDOI

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.

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

Link prediction for egocentrically sampled networks.

TL;DR: A new computationally efficient link prediction algorithm for egocentrically sampled networks, which estimates the underlying probability matrix by estimating its row space, and which outperforms many popular link prediction and graphon estimation techniques.
Journal ArticleDOI

DeepEC: Adversarial attacks against graph structure prediction models

TL;DR: A deep architecture-based adversarial attack method, called Deep Ensemble Coding, against link prediction, based on the assumption that links play different structural roles in structure organization, is proposed, which has satisfactory performance for link prediction.
Proceedings ArticleDOI

Learning Neural Point Processes with Latent Graphs

TL;DR: In this article, the authors proposed to learn to omit those types of events that do not contribute to the prediction of one target type during the formulation of NPPs. But this assumption can be problematic because in reality some event types this article does not contribute.
Journal ArticleDOI

CD-Based Indices for Link Prediction in Complex Network.

TL;DR: Improve and refine CD index, referred as CDI index, is improved and refine, combining the advantages of CD index and evolutionary mechanism of the network model BA, and Experimental results reveal thatCDI index can increase prediction accuracy of CD on negative assortative 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.

James A. Hanley, +1 more
- 01 Apr 1982 - 
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.