TY - JOUR
T1 - MultiplexSAGE
T2 - A Multiplex Embedding Algorithm for Inter-Layer Link Prediction
AU - Gallo, Luca
AU - Latora, Vito
AU - Pulvirenti, Alfredo
N1 - Publisher Copyright:
© 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
PY - 2024/10/1
Y1 - 2024/10/1
N2 - Research on graph representation learning has received great attention in recent years. However, most of the studies so far have focused on the embedding of single-layer graphs. The few studies dealing with the problem of representation learning of multilayer structures rely on the strong hypothesis that the inter-layer links are known, and this limits the range of possible applications. Here we propose MultiplexSAGE, a generalization of the GraphSAGE algorithm that allows embedding multiplex networks. We show that MultiplexSAGE is capable to reconstruct both the intra-layer and the inter-layer connectivity, outperforming competing methods. Next, through a comprehensive experimental analysis, we shed light also on the performance of the embedding, both in simple and multiplex networks, showing that both the density of the graph and the randomness of the links strongly influences the quality of the embedding.
AB - Research on graph representation learning has received great attention in recent years. However, most of the studies so far have focused on the embedding of single-layer graphs. The few studies dealing with the problem of representation learning of multilayer structures rely on the strong hypothesis that the inter-layer links are known, and this limits the range of possible applications. Here we propose MultiplexSAGE, a generalization of the GraphSAGE algorithm that allows embedding multiplex networks. We show that MultiplexSAGE is capable to reconstruct both the intra-layer and the inter-layer connectivity, outperforming competing methods. Next, through a comprehensive experimental analysis, we shed light also on the performance of the embedding, both in simple and multiplex networks, showing that both the density of the graph and the randomness of the links strongly influences the quality of the embedding.
KW - Graph embedding
KW - graph representation learning
KW - link prediction
KW - multiplex networks
UR - http://www.scopus.com/inward/record.url?scp=85160998406&partnerID=8YFLogxK
U2 - 10.1109/TNNLS.2023.3274565
DO - 10.1109/TNNLS.2023.3274565
M3 - Article
AN - SCOPUS:85160998406
SN - 2162-237X
VL - 35
SP - 14075
EP - 14084
JO - IEEE Transactions on Neural Networks and Learning Systems
JF - IEEE Transactions on Neural Networks and Learning Systems
IS - 10
ER -