# Limitations and Alternatives for the Evaluation of Large-scale Link Prediction

arXiv: https://arxiv.org/abs/1611.00547 · HTML: https://mlsanity.com/paper/1611.00547/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Nov 2016.

## Built on by (most cited first, 2 of 2)

- [An Approach for Link Prediction in Directed Complex Networks based on Asymmetric Similarity-Popularity](https://mlsanity.com/paper/2207.07399/) (2022)
- [A Complex Network based Graph Embedding Method for Link Prediction](https://mlsanity.com/paper/2209.04884/) (2022)

## Abstract (arXiv)

Link prediction, the problem of identifying missing links among a set of inter-related data entities, is a popular field of research due to its application to graph-like domains. Producing consistent evaluations of the performance of the many link prediction algorithms being proposed can be challenging due to variable graph properties, such as size and density. In this paper we first discuss traditional data mining solutions which are applicable to link prediction evaluation, arguing about their capacity for producing faithful and useful evaluations. We also introduce an innovative modification to a traditional evaluation methodology with the goal of adapting it to the problem of evaluating link prediction algorithms when applied to large graphs, by tackling the problem of class imbalance. We empirically evaluate the proposed methodology and, building on these findings, make a case for its importance on the evaluation of large-scale graph processing.