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
Replaying the geometric growth of complex networks and application to the AS internet
TL;DR: HyperMap as discussed by the authors is a simple method to map a real network to its hyperbolic space by replays the network's geometric growth, estimating at each time step the Hyperbolic coordinates of new nodes in a growing network by maximizing the likelihood of the network snapshot in the model.
Proceedings ArticleDOI
HybridSVD: When Collaborative Information is Not Enough
Evgeny Frolov,Ivan V. Oseledets +1 more
TL;DR: In this paper, the authors proposed a new hybrid algorithm that allows incorporating both user and item side information within the standard collaborative filtering technique, and they extended a simple PureSVD approach and inherited its unique advantages, such as highly efficient Lanczos-based optimization procedure, simplified hyperparameter tuning and a quick folding-in computation for generating recommendations instantly even in highly dynamic online environments.
Journal ArticleDOI
Degree-corrected stochastic block models and reliability in networks
TL;DR: The overall performance of the proposed corresponding reliable approach based on degree-corrected stochastic block models is better than the original version in predicting missing links, especially for the interactions between high-degree nodes.
Journal ArticleDOI
Community detection in dynamic signed network: an intimacy evolutionary clustering algorithm
TL;DR: In this paper, intimacy evolutionary clustering algorithm is proposed to detect community structure in dynamic networks and achieves better detection performance compared with several better algorithms in terms of detection accuracy.
Journal ArticleDOI
Extending association rules with graph patterns
Xin Wang,Yang Xu,Huayi Zhan +2 more
TL;DR: This work formalizes the GPARs mining problem and decompose it into two subproblems: Frequent pattern mining and rule generation, and develops a parallel algorithm along with an optimization strategy to construct DFS code graphs, whose nodes correspond to frequent patterns.
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.