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 MultiSAGE, a generalization of the GraphSAGE algorithm that allows to embed multiplex networks. We show that MultiSAGE is capable to reconstruct both the intra-layer and the inter-layer connectivity, outperforming GraphSAGE, which has been designed for simple graphs. Next, through a comprehensive experimental analysis, we shed light also on the performance of the embedding, both in simple and in multiplex networks, showing that either the density of the graph or the randomness of the links strongly influences the quality of the embedding.
翻译:图表代表性学习研究近年来受到极大关注,然而,到目前为止,大多数研究都集中在单层图的嵌入上。关于多层结构代表性学习问题的少数研究依赖于一个强有力的假设,即已知的跨层链接,这限制了可能的应用程序范围。我们在这里建议多层SAGE,即可嵌入多层网络的GreaphSAGE算法的概括化。我们表明,多层SAGE能够重建为简单图表设计的内和跨层连接,优于图AGE。接下来,通过全面的实验分析,我们还可以揭示嵌入简单和多层网络的性能,表明图的密度或链接的随机性对嵌入质量有强烈的影响。