{"title":"用于可解释和极化感知网络嵌入的有符号图自动编码器","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":"{\"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}","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}
Signed Graph Autoencoder for Explainable and Polarization-Aware Network Embeddings
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.