Signed Graph Autoencoder for Explainable and Polarization-Aware Network Embeddings

Nikolaos Nakis, Chrysoula Kosma, Giannis Nikolentzos, Michalis Chatzianastasis, Iakovos Evdaimon, Michalis Vazirgiannis
{"title":"Signed Graph Autoencoder for Explainable and Polarization-Aware Network Embeddings","authors":"Nikolaos Nakis, Chrysoula Kosma, Giannis Nikolentzos, Michalis Chatzianastasis, Iakovos Evdaimon, Michalis Vazirgiannis","doi":"arxiv-2409.10452","DOIUrl":null,"url":null,"abstract":"Autoencoders based on Graph Neural Networks (GNNs) have garnered significant\nattention in recent years for their ability to extract informative latent\nrepresentations, characterizing the structure of complex topologies, such as\ngraphs. Despite the prevalence of Graph Autoencoders, there has been limited\nfocus on developing and evaluating explainable neural-based graph generative\nmodels specifically designed for signed networks. To address this gap, we\npropose the Signed Graph Archetypal Autoencoder (SGAAE) framework. SGAAE\nextracts node-level representations that express node memberships over distinct\nextreme profiles, referred to as archetypes, within the network. This is\nachieved by projecting the graph onto a learned polytope, which governs its\npolarization. The framework employs a recently proposed likelihood for\nanalyzing signed networks based on the Skellam distribution, combined with\nrelational archetypal analysis and GNNs. Our experimental evaluation\ndemonstrates the SGAAEs' capability to successfully infer node memberships over\nthe different underlying latent structures while extracting competing\ncommunities formed through the participation of the opposing views in the\nnetwork. Additionally, we introduce the 2-level network polarization problem\nand show how SGAAE is able to characterize such a setting. The proposed model\nachieves high performance in different tasks of signed link prediction across\nfour real-world datasets, outperforming several baseline models.","PeriodicalId":501032,"journal":{"name":"arXiv - CS - Social and Information Networks","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Social and Information Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.10452","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Autoencoders based on Graph Neural Networks (GNNs) have garnered significant attention in recent years for their ability to extract informative latent representations, characterizing the structure of complex topologies, such as graphs. Despite the prevalence of Graph Autoencoders, there has been limited focus on developing and evaluating explainable neural-based graph generative models specifically designed for signed networks. To address this gap, we propose the Signed Graph Archetypal Autoencoder (SGAAE) framework. SGAAE extracts node-level representations that express node memberships over distinct extreme profiles, referred to as archetypes, within the network. This is achieved by projecting the graph onto a learned polytope, which governs its polarization. The framework employs a recently proposed likelihood for analyzing signed networks based on the Skellam distribution, combined with relational archetypal analysis and GNNs. Our experimental evaluation demonstrates the SGAAEs' capability to successfully infer node memberships over the different underlying latent structures while extracting competing communities formed through the participation of the opposing views in the network. Additionally, we introduce the 2-level network polarization problem and show how SGAAE is able to characterize such a setting. The proposed model achieves high performance in different tasks of signed link prediction across four real-world datasets, outperforming several baseline models.
用于可解释和极化感知网络嵌入的有符号图自动编码器
近年来,基于图神经网络(GNN)的自动编码器因其能够提取信息性潜在表征,描述复杂拓扑结构(如图)的特征而备受关注。尽管图自动编码器非常普遍,但专门为签名网络设计的、基于神经的可解释图生成模型的开发和评估却一直受到关注。为了弥补这一不足,我们提出了签名图原型自动编码器(SGAAE)框架。SGAAE 提取节点级表示,表达网络中不同极端剖面(称为原型)上的节点成员身份。这是通过将图投影到学习多面体上实现的,学习多面体控制着图的极化。该框架采用了最近提出的基于 Skellam 分布的签名网络分析似然法,并结合了相关原型分析和 GNN。我们的实验评估证明,SGAAEs 能够成功推断出不同潜在结构的节点成员身份,同时提取出网络中对立观点参与形成的竞争群体。此外,我们还引入了两级网络极化问题,并展示了 SGAAE 是如何描述这种情况的。所提出的模型在四个真实世界数据集的不同签名链接预测任务中都取得了很高的性能,超过了几个基线模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信