Link Prediction for Partially Observed Networks
TLDR
A new method is developed that treats the observed network as a sample of the true network with different sampling rates for positive (true edges) and negative (absent edges) examples and obtains a relative ranking of potential links by their probabilities, using information on network topology as well as node covariates if available.Abstract:
Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples, that is, edges known for certain to be absent, which creates a difficulty for existing supervised learning approaches. We develop a new method that treats the observed network as a sample of the true network with different sampling rates for positive (true edges) and negative (absent edges) examples. We obtain a relative ranking of potential links by their probabilities, using information on network topology as well as node covariates if available. The method relies on the intuitive assumption that if two pairs of nodes are similar, the probabilities of these pairs forming an edge are also similar. Empirically, the method performs well under many settings, including when the observed network is sparse. We apply the method to a protein–protein interaction network and a school friendship network.read more
Citations
More filters
Journal ArticleDOI
A Survey of Link Prediction in Complex Networks
TL;DR: This survey will review the general-purpose techniques at the heart of the link prediction problem, which can be complemented by domain-specific heuristic methods in practice.
Journal ArticleDOI
A review of stochastic block models and extensions for graph clustering
TL;DR: Different approaches and extensions proposed for different aspects in model-based clustering of graphs, such as the type of the graph, the clustering approach, the inference approach, and whether the number of groups is selected or estimated are reviewed.
Journal ArticleDOI
Estimating network edge probabilities by neighbourhood smoothing
TL;DR: In this article, a neighbourhood smoothing method is proposed to estimate the expectation of the adjacency matrix directly without making the structural assumptions that graphon estimation requires, which has a competitive mean squared error rate and outperforms many benchmark methods for link prediction.
Proceedings ArticleDOI
Scalable Text and Link Analysis with Mixed-Topic Link Models
TL;DR: This paper combines classic ideas in topic modeling with a variant of the mixed-membership block model recently developed in the statistical physics community, and has the advantage that its parameters, including the mixture of topics of each document and the resulting overlapping communities, can be inferred with a simple and scalable expectation-maximization algorithm.
Journal ArticleDOI
Extension of neighbor-based link prediction methods for directed, weighted and temporal social networks
TL;DR: A directional link prediction measure is introduced by extending neighbor based measures as directional pattern based to take into account the role of link direction in directed networks to improve accuracy of link prediction.
References
More filters
Book
Convex Optimization
Stephen Boyd,Lieven Vandenberghe +1 more
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Journal IssueDOI
The link-prediction problem for social networks
David Liben-Nowell,Jon Kleinberg +1 more
TL;DR: Experiments on large coauthorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.
Journal ArticleDOI
A new status index derived from sociometric analysis.
TL;DR: A new method of computation which takes into account who chooses as well as how many choose is presented, which introduces the concept of attenuation in influence transmitted through intermediaries.
Journal ArticleDOI
Friends and neighbors on the Web
Lada A. Adamic,Eytan Adar +1 more
TL;DR: In this paper, the authors show that some factors are better indicators of social connections than others, and that these indicators vary between user populations, and provide potential applications in automatically inferring real world connections and discovering, labeling, and characterizing communities.
Journal ArticleDOI
Link prediction in complex networks: A survey
TL;DR: 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.