SEAL+: A subgraph-enhanced framework for link prediction with graph neural networks

IF 10.4 1区 计算机科学 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Reyhane Karami , S. Mehdi Vahidipour , Alireza Rezvanian
{"title":"SEAL+: A subgraph-enhanced framework for link prediction with graph neural networks","authors":"Reyhane Karami ,&nbsp;S. Mehdi Vahidipour ,&nbsp;Alireza Rezvanian","doi":"10.1016/j.jii.2025.100802","DOIUrl":null,"url":null,"abstract":"<div><div>Link prediction is a critical research topic in network analysis, typically formulated as a classification problem where the goal is to determine whether a link exists between a pair of nodes (denoted as 1 in existence and 0 for non-existence). In most existing works, the feature vectors of a pair of nodes are combined to obtain the feature vector representing the link between them; these feature vectors (or embeddings) are constructed using graph neural networks (GNNs). This paper uses a GNN-based link prediction method called EAL as the baseline. EAL consists of an Encoder and a Decoder. A significant challenge in EAL is that the feature vector extracted by the GNN can be identical for different pairs of nodes. To address this issue, we propose leveraging the concept of subgraphs to enhance link prediction performance. To this end, the Encoder is equipped with subgraphs, forming the SEAL framework. One limitation of SEAL is that it generates identical link representations for different links when the embeddings of the nodes involved are the same. To overcome this limitation, the Decoder of SEAL also uses the subgraph information, resulting in the novel framework SEAL+. We evaluate these two frameworks against baseline methods using various metrics, demonstrating their superiority. Specifically, SEAL+ achieves average improvements of 10.25 %, 17.25 %, 3.75 %, and 4.65 % in terms of accuracy, F1-Score, average precision, and area under the precision-recall curve, respectively, compared to the SEAL.</div></div>","PeriodicalId":55975,"journal":{"name":"Journal of Industrial Information Integration","volume":"44 ","pages":"Article 100802"},"PeriodicalIF":10.4000,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Industrial Information Integration","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2452414X25000263","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Link prediction is a critical research topic in network analysis, typically formulated as a classification problem where the goal is to determine whether a link exists between a pair of nodes (denoted as 1 in existence and 0 for non-existence). In most existing works, the feature vectors of a pair of nodes are combined to obtain the feature vector representing the link between them; these feature vectors (or embeddings) are constructed using graph neural networks (GNNs). This paper uses a GNN-based link prediction method called EAL as the baseline. EAL consists of an Encoder and a Decoder. A significant challenge in EAL is that the feature vector extracted by the GNN can be identical for different pairs of nodes. To address this issue, we propose leveraging the concept of subgraphs to enhance link prediction performance. To this end, the Encoder is equipped with subgraphs, forming the SEAL framework. One limitation of SEAL is that it generates identical link representations for different links when the embeddings of the nodes involved are the same. To overcome this limitation, the Decoder of SEAL also uses the subgraph information, resulting in the novel framework SEAL+. We evaluate these two frameworks against baseline methods using various metrics, demonstrating their superiority. Specifically, SEAL+ achieves average improvements of 10.25 %, 17.25 %, 3.75 %, and 4.65 % in terms of accuracy, F1-Score, average precision, and area under the precision-recall curve, respectively, compared to the SEAL.
SEAL+:一种用于图神经网络链接预测的子图增强框架
链路预测是网络分析中的一个关键研究课题,通常被表述为一个分类问题,其目标是确定一对节点之间是否存在链路(表示存在1,表示不存在0)。在现有的大多数工作中,对一对节点的特征向量进行组合,得到代表它们之间联系的特征向量;这些特征向量(或嵌入)是使用图神经网络(gnn)构建的。本文采用一种基于gnn的链路预测方法EAL作为基线。EAL由一个编码器和一个解码器组成。在EAL中面临的一个重大挑战是,GNN提取的特征向量对于不同的节点对可能是相同的。为了解决这个问题,我们建议利用子图的概念来提高链接预测的性能。为此,编码器配备了子图,形成SEAL框架。SEAL的一个限制是,当涉及的节点嵌入相同时,它为不同的链接生成相同的链接表示。为了克服这一限制,SEAL的解码器也使用了子图信息,形成了新的框架SEAL+。我们使用各种度量标准对这两个框架的基线方法进行了评估,证明了它们的优越性。具体而言,与SEAL相比,SEAL+在准确率、F1-Score、平均精密度和精密度-召回率曲线下面积方面分别实现了10.25%、17.25%、3.75%和4.65%的平均提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Industrial Information Integration
Journal of Industrial Information Integration Decision Sciences-Information Systems and Management
CiteScore
22.30
自引率
13.40%
发文量
100
期刊介绍: The Journal of Industrial Information Integration focuses on the industry's transition towards industrial integration and informatization, covering not only hardware and software but also information integration. It serves as a platform for promoting advances in industrial information integration, addressing challenges, issues, and solutions in an interdisciplinary forum for researchers, practitioners, and policy makers. The Journal of Industrial Information Integration welcomes papers on foundational, technical, and practical aspects of industrial information integration, emphasizing the complex and cross-disciplinary topics that arise in industrial integration. Techniques from mathematical science, computer science, computer engineering, electrical and electronic engineering, manufacturing engineering, and engineering management are crucial in this context.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信