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
Stability of similarity measurements for bipartite networks
TL;DR: Zhang et al. as discussed by the authors investigated the stabilities of fifteen similarity measurements by comparing the similarity matrixes of two data samples which are randomly divided from original data sets and found that the fifteen measurements can be well classified into three clusters according to their stabilities, and measurements in the same cluster have similar mathematical definitions.
Proceedings ArticleDOI
A local seed selection algorithm for overlapping community detection
TL;DR: This paper proposes a novel seeding algorithm which is parameter free, utilizes merely the local structure of the network, and identifies good seeds which span over the whole network and can dramatically reduce the execution time of community detection.
Journal ArticleDOI
Semi-Supervised Multi-View Learning for Gene Network Reconstruction
TL;DR: The results indicate that gene regulatory network reconstruction for the real datasets is more difficult for S. cerevisiae than for E. coli, while the proposed algorithm clearly shows improved performance over the state of the art methods.
Journal ArticleDOI
Combining contextual, temporal and topological information for unsupervised link prediction in social networks
TL;DR: This paper evaluated the proposed weighting criteria with two popular weighted similarity functions (Adamic-Adar and Common Neighbors) in ten networks frequently used in experiments with link prediction and found that the proposed criteria were statistically better than the ones obtained from the weighting criterion that is exclusively based on topological information.
Posted Content
Stability of similarity measurements for bipartite networks
TL;DR: A top-n-stability method for personalized recommendation is developed, and it is found that the unstable similarities would recommend false information to users, and the performance of recommendation would be largely improved by using stable similarity measurements.
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.