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
Journal ArticleDOI

Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms

TL;DR: Wang et al. as mentioned in this paper implemented extensive experimental comparisons between 2-hop and 3-hop similarity indices on 137 real networks and found that 3-Hop-based indices are more suitable for disassortative networks with lower densities and lower average clustering coefficients.
Journal ArticleDOI

Measuring the complexity of complex network by Tsallis entropy

TL;DR: A novel structure entropy which is based on Tsallis entropy is introduced in this paper which combines the fractal dimension and local dimension which are both the significant property of network structure, and it would degenerate to the Shannon entropy based on the local dimension when fractaldimension equals to 1.
Journal ArticleDOI

A statistical infinite feature cascade-based approach to anomaly detection for dynamic social networks

TL;DR: The proposed anomaly detection approach is validated by experiments on synthetic and real social network datasets and outperforms other related approaches in terms of some statistical performance measures, especially applied to binary normal-abnormal classification test.
BookDOI

Advances in Artificial Intelligence: SBIA 2012

TL;DR: This article proposes a formal methodology for knowledge representation in DeLP, that defines a set of guidelines to be used during this phase of knowledge representation, and results in an key tool to improve DeLP’s applicability to concrete domains.
Journal ArticleDOI

Evolving networks - Using past structure to predict the future

TL;DR: This study examines the use of links between a pair of nodes to predict their common neighbors and analyzes the relationship between the weight and the structure in static networks, evolving networks, and in the corresponding randomized 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.