Systematic Biases in Link Prediction: comparing heuristic and graph embedding based methods

  title={Systematic Biases in Link Prediction: comparing heuristic and graph embedding based methods},
  author={Aakash Sinha and R{\'e}my Cazabet and R{\'e}mi Vaudaine},
  booktitle={COMPLEX NETWORKS},
Link prediction is a popular research topic in network analysis. In the last few years, new techniques based on graph embedding have emerged as a powerful alternative to heuristics. In this article, we study the problem of systematic biases in the prediction, and show that some methods based on graph embedding offer less biased results than those based on heuristics, despite reaching lower scores according to usual quality scores. We discuss the relevance of this finding in the context of the… 
Benchmarking and Analyzing Unsupervised Network Representation Learning and the Illusion of Progress
It is found that classical methods, often dismissed or not considered by recent efforts, can compete on certain types of datasets if they are tuned appropriately; and a couple of methods based on matrix factorization offer a small but not always consistent advantage over alternative methods.
Network Science Cheatsheet
networks are often analyzed as static objects because 1) it’s harder to obtain dynamic information, 2) taking dynamic into account makes some analysis more di cult.
Network Representation Learning: Consolidation and Renewed Bearing
This systematic yet comprehensive experimental survey benchmarks several popular network representation learning methods operating on two key tasks: link prediction and node classification and finds that MNMF, a community preserving embedding method, is the most competitive method for the link prediction task.
Model-independent methods for embedding directed networks into Euclidean and hyperbolic spaces
A framework based on the dimension reduction of proximity matrices reflecting the network topology, coupled with a general conversion method transforming Euclidean node coordinates into hyperbolic ones even for directed networks is proposed.
DRAGON: Dynamic Recurrent Accelerator for Graph Online Convolution
This work proposes and implements a novel efficient architecture, capable of producing similar speed-up and performance than baseline but at a fraction of its hardware requirements and power consumption, and demonstrates the unique functional qualities of the approach as a flexible and fault-tolerant solution that makes it an interesting alternative for an anthology of applicative scenarios.
Evaluation of knowledge graph embedding approaches for drug-drug interaction prediction in realistic settings
A simple disjoint cross-validation scheme to evaluate drug-drug interaction predictions for the scenarios where the drugs have no known DDIs is proposed and showed that the knowledge embeddings are powerful predictors and comparable to current state-of-the-art methods for inferring new DDIs.


Link Prediction in Complex Networks: A Survey
A Survey of Link Prediction in Social Networks
This article surveys some representative link prediction methods by categorizing them by the type of models, largely considering three types of models: first, the traditional (non-Bayesian) models which extract a set of features to train a binary classification model, and second, the probabilistic approaches which model the joint-probability among the entities in a network by Bayesian graphical models.
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
This survey conducts a comprehensive review of the literature in graph embedding and proposes two taxonomies ofGraph embedding which correspond to what challenges exist in differentgraph embedding problem settings and how the existing work addresses these challenges in their solutions.
VERSE: Versatile Graph Embeddings from Similarity Measures
VERtex Similarity Embeddings (VERSE), a simple, versatile, and memory-efficient method that derives graph embeddings explicitly calibrated to preserve the distributions of a selected vertex-to-vertex similarity measure, is proposed.
New perspectives and methods in link prediction
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task and presents an effective flow-based predicting algorithm, formal bounds on imbalance in sparse network link prediction, and employ an evaluation method appropriate for the observed imbalance.
Link prediction using supervised learning
This research identifies a set of features that are key to the superior performance under the supervised learning setup, and shows that a small subset of features always plays a significant role in the link prediction job.
A Survey on Network Embedding
This survey focuses on categorizing and then reviewing the current development on network embedding methods, and point out its future research directions, covering the structure- and property-preserving network embeding methods, the network embedded methods with side information, and the advanced information preserving network embedting methods.
Fast unfolding of communities in large networks
This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.
Node Classification in Social Networks
When dealing with large graphs, such as those that arise in the context of online social networks, a subset of nodes may be labeled. These labels can indicate demographic values, interest, beliefs or