Understanding the Design Principles of Link Prediction in Directed Settings

Abstract

Link prediction is a widely studied task in Graph Representation Learning (GRL) for modeling relational data. The early theories in GRL were based on the assumption of a symmetric adjacency matrix, reflecting an undirected setting. As a result, much of the following state-of-the-art research has continued to operate under this symmetry assumption, even though real-world data often involve crucial information conveyed through the direction of relationships. This oversight limits the ability of these models to fully capture the complexity of directed interactions. In this paper, we focus on the challenge of directed link prediction by evaluating key heuristics that have been successful in undirected settings. We propose simple but effective adaptations of these heuristics to the directed link prediction task and demonstrate that these modifications produce competitive performance compared to the leading Graph Neural Networks (GNNs) originally designed for undirected graphs. Through an extensive set of experiments, we derive insights that inform the development of a novel framework for directed link prediction, which not only surpasses baseline methods but also outperforms state-of-the-art GNNs on multiple benchmarks.

References in corpus (7)

• LINE: Large-scale Information Network Embedding
• Predicting Missing Links via Local Information
• Missing and spurious interactions and the reconstruction of complex networks
• Effective and Efficient Similarity Index for Link Prediction of Complex Networks
• Alleviating the Inconsistency Problem of Applying Graph Neural Network to Fraud Detection
• PinnerSage: Multi-Modal User Embedding Framework for Recommendations at Pinterest
• Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning