Graph Auto-Encoders for Learning Edge Representations

Rennard, Virgile; Nikolentzos, Giannis; Vazirgiannis, Michalis

doi:10.1007/978-3-030-65351-4_10

Cited by 4 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Over the last few years, the overall effectiveness of the GAE and VGAE paradigms at addressing link prediction has been widely confirmed experimentally [15,16,17,18,19,20,21,22,24,27,28,51,52,53]. Numerous research efforts proposed and evaluated variants of GAE and VGAE designed for this specific task, improving their performances by considering more refined encoders [17,21,51,54], decoders [18,20,21,22] or regularization techniques [15,19,28].…”

Section: Link Prediction With Gae Vgae and Extensionsmentioning

confidence: 99%

“…Numerous research efforts proposed and evaluated variants of GAE and VGAE designed for this specific task, improving their performances by considering more refined encoders [17,21,51,54], decoders [18,20,21,22] or regularization techniques [15,19,28]. Other works also successfully addressed different downstream tasks that are closely related to link prediction, such as edge classification [52] or graph-based recommendation [51,53,55].…”

Section: Link Prediction With Gae Vgae and Extensionsmentioning

confidence: 99%

See 1 more Smart Citation

Modularity-Aware Graph Autoencoders for Joint Community Detection and Link Prediction

Salha-Galvan¹,

Lutzeyer²,

Dasoulas³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Graph autoencoders (GAE) and variational graph autoencoders (VGAE) emerged as powerful methods for link prediction. Their performances are less impressive on community detection problems where, according to recent and concurring experimental evaluations, they are often outperformed by simpler alternatives such as the Louvain method. It is currently still unclear to which extent one can improve community detection with GAE and VGAE, especially in the absence of node features. It is moreover uncertain whether one could do so while simultaneously preserving good performances on link prediction. In this paper, we show that jointly addressing these two tasks with high accuracy is possible. For this purpose, we introduce and theoretically study a community-preserving message passing scheme, doping our GAE and VGAE encoders by considering both the initial graph structure and modularity-based prior communities when computing embedding spaces. We also propose novel training and optimization strategies, including the introduction of a modularity-inspired regularizer complementing the existing reconstruction losses for joint link prediction and community detection. We demonstrate the empirical effectiveness of our approach, referred to as Modularity-Aware GAE and VGAE, through in-depth experimental validation on various real-world graphs.

show abstract