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
On analyzing graphs with motif-paths
TL;DR: This paper examines how motif-paths can be used in three path-based mining tasks, namely link prediction, local graph clustering and node ranking, and develops a novel defragmentation method to enhance it.
Journal ArticleDOI
A Novel Model to Identify the Influential Nodes: Evidence Theory Centrality
Jie Zhao,Yutong Song,Yong Deng +2 more
TL;DR: This paper uses the Susceptible-infected model and Kendall’s tau coefficient to rate the results gained from different measures and combines them to generate a new ranking result, namely Evidence Theory Centrality (ETC).
Journal ArticleDOI
Empirical comparison of network sampling: How to choose the most appropriate method?
TL;DR: The techniques with subgraph induction improve the performance of techniques without induction and create denser sample networks with larger average degree, and the breadth-first exploration sampling proves as the best performing technique.
Posted Content
Diffusion Maps for Textual Network Embedding
TL;DR: This paper proposed diffusion maps for textual network embedding (DMTE), integrating global structural information of the graph to capture the semantic relatedness between texts, with a diffusion-convolution operation applied on the text inputs.
Journal ArticleDOI
A preference random walk algorithm for link prediction through mutual influence nodes in complex networks
TL;DR: In this article , an efficient method is proposed for improving local random walk by encouraging random walk to move, in every step, towards the node which has a stronger influence, therefore, the next node is selected according to the influence of the source node.
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.