Abstract

Link prediction is a technique to forecast future new or missing relationships between entities based on the current network information. Graph theory and network science are theoretical concepts that have influenced the link prediction research. Although previous reviews clearly outlined the link prediction research, it was focused on describing prediction approaches only. However, analysis of related studies identified other components that influence link prediction. This review aims to present a continued review and introduce the taxonomy of link prediction using three main components: the prediction approaches, prediction features, and prediction measurements. Each component has been detailed using its own taxonomy available at the present review. Furthermore, this review compares the prediction approaches and prediction features also benchmark algorithms and measurement methods of previous link prediction studies. In conclusion, the previous studies mostly focused on structural features and similarity-based approaches, while measuring the proposed methods using the Area Under the Curve (AUC) score. The proposed link prediction taxonomy can guide the researchers to generate new ideas and innovations that contribute to the link prediction research.

Highlights

  • In 1999, Barabási & Albert conducted a study on connectivity between node pairs due to adding new nodes to a growing network, and the new nodes were attached to a node that connected before [1]

  • The three main contributions of this review are as follows: 1) It reviews the studies on link prediction and proposes a taxonomy of link prediction with three components

  • 2) An extensive examination of relevant link prediction research to validate areas that have been previously conducted by researchers

Read more

Summary

Introduction

In 1999, Barabási & Albert conducted a study on connectivity between node pairs due to adding new nodes to a growing network, and the new nodes were attached to a node that connected before [1] Liben-Nowell & Kleinberg, in 2007, formalized this new interaction as a “Link Prediction Problem” and developed an approach known as “Common Neighbors” based on the proximity of nodes in the network [4]. Other studies, such as the Hub Promoted Index (HPI) [5], the Hub Depressed Index (HDI) [5], the Leicht-Holme-Nerman-1

Objectives
Methods
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call