Embedding Learning on Multiplex Networks for Link Prediction
Orell Trautmann, Olaf Wolkenhauer (SU), Cl\'emence R\'eda (IBENS)

TL;DR
This paper reviews embedding learning models for multiplex networks in link prediction, proposing refined classifications, addressing evaluation fairness, and introducing a new testing procedure for directed networks to improve future research.
Contribution
It offers a comprehensive taxonomy of models, discusses evaluation challenges, and proposes a novel testing method for directed multiplex networks.
Findings
Refined taxonomies for classifying embedding models
Addressed reproducibility and fairness in evaluations
Proposed a new testing procedure for directed multiplex networks
Abstract
Over the past years, embedding learning on networks has shown tremendous results in link prediction tasks for complex systems, with a wide range of real-life applications. Learning a representation for each node in a knowledge graph allows us to capture topological and semantic information, which can be processed in downstream analyses later. In the link prediction task, high-dimensional network information is encoded into low-dimensional vectors, which are then fed to a predictor to infer new connections between nodes in the network. As the network complexity (that is, the numbers of connections and types of interactions) grows, embedding learning turns out increasingly challenging. This review covers published models on embedding learning on multiplex networks for link prediction. First, we propose refined taxonomies to classify and compare models, depending on the type of embeddings…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Bioinformatics and Genomic Networks
