Improving Link Prediction Accuracy of Network Embedding Algorithms via Rich Node Attribute Information

Weiwei Gu;Jinqiang Hou;Weiyi Gu
{"title":"Improving Link Prediction Accuracy of Network Embedding Algorithms via Rich Node Attribute Information","authors":"Weiwei Gu;Jinqiang Hou;Weiyi Gu","doi":"10.23919/JSC.2023.0018","DOIUrl":null,"url":null,"abstract":"Complex networks are widely used to represent an abundance of real-world relations ranging from social networks to brain networks. Inferring missing links or predicting future ones based on the currently observed network is known as the link prediction task. Recent network embedding based link prediction algorithms have demonstrated ground-breaking performance on link prediction accuracy. Those algorithms usually apply node attributes as the initial feature input to accelerate the convergence speed during the training process. However, they do not take full advantage of node feature information. In this paper, besides applying feature attributes as the initial input, we make better utilization of node attribute information by building attributable networks and plugging attributable networks into some typical link prediction algorithms and name this algorithm Attributive Graph Enhanced Embedding (AGEE). AGEE is able to automatically learn the weighting trades-off between the structure and the attributive networks. Numerical experiments show that AGEE can improve the link prediction accuracy by around 3% compared with SEAL, Variational Graph AutoEncoder (VGAE), and node2vec.","PeriodicalId":67535,"journal":{"name":"社会计算(英文)","volume":"4 4","pages":"326-336"},"PeriodicalIF":0.0000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10412134","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"社会计算(英文)","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10412134/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Complex networks are widely used to represent an abundance of real-world relations ranging from social networks to brain networks. Inferring missing links or predicting future ones based on the currently observed network is known as the link prediction task. Recent network embedding based link prediction algorithms have demonstrated ground-breaking performance on link prediction accuracy. Those algorithms usually apply node attributes as the initial feature input to accelerate the convergence speed during the training process. However, they do not take full advantage of node feature information. In this paper, besides applying feature attributes as the initial input, we make better utilization of node attribute information by building attributable networks and plugging attributable networks into some typical link prediction algorithms and name this algorithm Attributive Graph Enhanced Embedding (AGEE). AGEE is able to automatically learn the weighting trades-off between the structure and the attributive networks. Numerical experiments show that AGEE can improve the link prediction accuracy by around 3% compared with SEAL, Variational Graph AutoEncoder (VGAE), and node2vec.
通过丰富的节点属性信息提高网络嵌入算法的链接预测精度
从社交网络到大脑网络,复杂网络被广泛用于表示现实世界中的大量关系。根据当前观察到的网络推断缺失的链接或预测未来的链接被称为链接预测任务。最近,基于网络嵌入的链接预测算法在链接预测准确性方面取得了突破性进展。这些算法通常将节点属性作为初始特征输入,以加快训练过程中的收敛速度。然而,它们并没有充分利用节点特征信息。在本文中,除了将特征属性作为初始输入外,我们还通过构建可归属网络来更好地利用节点属性信息,并将可归属网络插入到一些典型的链接预测算法中,并将这种算法命名为属性图增强嵌入(AGEE)。AGEE 能够自动学习结构网络和属性网络之间的权重权衡。数值实验表明,与 SEAL、变异图自动编码器(VGAE)和 node2vec 相比,AGEE 可将链接预测准确率提高约 3%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.80
自引率
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学术官方微信