Multi-Class and Multi-Task Strategies for Neural Directed Link Prediction
Claudio Moroni, Claudio Borile, Carolina Mattsson, Michele Starnini, Andr\'e Panisson

TL;DR
This paper introduces multi-class and multi-task strategies for neural directed link prediction, effectively capturing edge directionality and bidirectionality across all sub-tasks, outperforming traditional methods.
Contribution
The paper proposes three novel strategies—multi-class and multi-task frameworks—that improve neural directed link prediction across all sub-tasks, addressing limitations of existing approaches.
Findings
Strategies outperform traditional methods on multiple datasets
Achieve better performance in all three DLP sub-tasks
Models effectively capture directionality and bidirectionality
Abstract
Link Prediction is a foundational task in Graph Representation Learning, supporting applications like link recommendation, knowledge graph completion and graph generation. Graph Neural Networks have shown the most promising results in this domain and are currently the de facto standard approach to learning from graph data. However, a key distinction exists between Undirected and Directed Link Prediction: the former just predicts the existence of an edge, while the latter must also account for edge directionality and bidirectionality. This translates to Directed Link Prediction (DLP) having three sub-tasks, each defined by how training, validation and test sets are structured. Most research on DLP overlooks this trichotomy, focusing solely on the "existence" sub-task, where training and test sets are random, uncorrelated samples of positive and negative directed edges. Even in the works…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnomaly Detection Techniques and Applications
MethodsADaptive gradient method with the OPTimal convergence rate
