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
Research on Social Recommender Systems
TL;DR: An overview of the field of social recommender systems, including trust inference algorithms, key techniques and typical applications, is presented.
Journal ArticleDOI
Dual Implicit Mining-Based Latent Friend Recommendation
TL;DR: A new dual implicit mining-based latent friend recommendation model that simultaneously considers the implicit interest topics of users and the implicit link relationships between the users in the local topic cliques is proposed.
Journal ArticleDOI
Dual network embedding for representing research interests in the link prediction problem on co-authorship networks.
TL;DR: Standard graph feature engineering and network embedding methods were combined for constructing co-author recommender system formulated as LP problem and prediction of future graph structure and shows better performance for stated binary classification tasks on several co-authorship networks.
Journal ArticleDOI
Link Prediction in Stochastic Social Networks: Learning Automata Approach
TL;DR: This paper proposes a new link prediction method based on learning automata for stochastic social networks that achieves better results in comparison to the classical link prediction algorithms in the stochastics social networks.
Journal ArticleDOI
Link prediction in dynamic networks based on the attraction force between nodes
TL;DR: A novel approach for link prediction in dynamic networks based on the attraction force between nodes (DLPA) is proposed for detecting missing links and for predicting whether potential links will become real links in the future, and the proposed approach outperforms several baseline algorithms in terms of prediction accuracy.
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.