基于链接值估计的复杂网络链接预测图注意网络

Zhiwei Zhang, Xiaoyin Wu, Haifeng Xu, Lin Cui, Haining Zhang, Wenbo Qin
{"title":"基于链接值估计的复杂网络链接预测图注意网络","authors":"Zhiwei Zhang, Xiaoyin Wu, Haifeng Xu, Lin Cui, Haining Zhang, Wenbo Qin","doi":"10.1109/ISSSR58837.2023.00036","DOIUrl":null,"url":null,"abstract":"Link prediction in complex networks aims to discover hidden or forthcoming links between network nodes, and it is widely used in areas such as knowledge graphs. Existing Graph Neural Networks (GNNs) often only consider whether nodes are connected or calculate the weight of the links through node features when they apply network structure and features to learn node representation in the manner of neighborhood aggregation, while neglecting the intrinsic value of links. This paper analyzes the value of links based on network structure and proposes corresponding evaluation metrics. It integrates the value of links into the construction and training of the link prediction graph attention network, not only improving the performance of the link prediction, but also providing theoretical support for the interpretability of the prediction results. Extensive link prediction experiments were carried out on representative open graph benchmark data, and the results show that the link prediction framework proposed in this paper has good performance and generalization capabilities.","PeriodicalId":185173,"journal":{"name":"2023 9th International Symposium on System Security, Safety, and Reliability (ISSSR)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Link Value Estimation Based Graph Attention Network for Link Prediction in Complex Networks\",\"authors\":\"Zhiwei Zhang, Xiaoyin Wu, Haifeng Xu, Lin Cui, Haining Zhang, Wenbo Qin\",\"doi\":\"10.1109/ISSSR58837.2023.00036\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Link prediction in complex networks aims to discover hidden or forthcoming links between network nodes, and it is widely used in areas such as knowledge graphs. Existing Graph Neural Networks (GNNs) often only consider whether nodes are connected or calculate the weight of the links through node features when they apply network structure and features to learn node representation in the manner of neighborhood aggregation, while neglecting the intrinsic value of links. This paper analyzes the value of links based on network structure and proposes corresponding evaluation metrics. It integrates the value of links into the construction and training of the link prediction graph attention network, not only improving the performance of the link prediction, but also providing theoretical support for the interpretability of the prediction results. Extensive link prediction experiments were carried out on representative open graph benchmark data, and the results show that the link prediction framework proposed in this paper has good performance and generalization capabilities.\",\"PeriodicalId\":185173,\"journal\":{\"name\":\"2023 9th International Symposium on System Security, Safety, and Reliability (ISSSR)\",\"volume\":\"107 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 9th International Symposium on System Security, Safety, and Reliability (ISSSR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSSR58837.2023.00036\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 9th International Symposium on System Security, Safety, and Reliability (ISSSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSSR58837.2023.00036","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

复杂网络中的链路预测旨在发现网络节点之间隐藏或即将出现的链路,广泛应用于知识图谱等领域。现有的图神经网络(Graph Neural Networks, gnn)在利用网络结构和特征以邻域聚合的方式学习节点表示时,往往只考虑节点是否连通或通过节点特征计算链路的权重,而忽略了链路的内在价值。本文基于网络结构分析了链路的价值,并提出了相应的评价指标。它将链路的价值融入到链路预测图注意网络的构建和训练中,不仅提高了链路预测的性能,而且为预测结果的可解释性提供了理论支持。在具有代表性的开放图基准数据上进行了大量的链路预测实验,结果表明本文提出的链路预测框架具有良好的性能和泛化能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Link Value Estimation Based Graph Attention Network for Link Prediction in Complex Networks
Link prediction in complex networks aims to discover hidden or forthcoming links between network nodes, and it is widely used in areas such as knowledge graphs. Existing Graph Neural Networks (GNNs) often only consider whether nodes are connected or calculate the weight of the links through node features when they apply network structure and features to learn node representation in the manner of neighborhood aggregation, while neglecting the intrinsic value of links. This paper analyzes the value of links based on network structure and proposes corresponding evaluation metrics. It integrates the value of links into the construction and training of the link prediction graph attention network, not only improving the performance of the link prediction, but also providing theoretical support for the interpretability of the prediction results. Extensive link prediction experiments were carried out on representative open graph benchmark data, and the results show that the link prediction framework proposed in this paper has good performance and generalization capabilities.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信