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
Proceedings Article
Efficient sparse low-rank tensor completion using the Frank-Wolfe algorithm
TL;DR: This paper proposes a time and space-efficient low-rank tensor completion algorithm by using the scaled latent nuclear norm for regularization and the Frank-Wolfe algorithm for optimization.
Journal ArticleDOI
Exploiting transfer learning for the reconstruction of the human gene regulatory network.
TL;DR: A novel machine learning method is proposed which outperforms state-of-the-art approaches and identifies previously unknown functional relationships among the analyzed genes.
Journal ArticleDOI
Measuring transferring similarity via local information
TL;DR: The Belief Transferring Similarity (BTS) model is proposed, which addresses the issue of the sparsity of dataset by considering the high-order similarity and transforms uncertain interval to a certain state based on fuzzy systems theory.
Journal ArticleDOI
Community detection in complex networks using density-based clustering algorithm and manifold learning
TL;DR: A new community detection method (named IsoFdp) is proposed which uses IsoMap technique to map the network data into a low dimensional manifold which can reveal diverse pair-wised similarity and an improved partition density function is proposed to select the proper number of communities automatically.
Journal ArticleDOI
A vertex similarity index for better personalized recommendation
TL;DR: This work proposes a novel vertex similarity index named CosRA, which combines advantages of both the cosine index and the resource-allocation (RA) index and shows that the CosRA-based method has better performance in accuracy, diversity and novelty than some benchmark methods.
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.