Learning accurate neighborhood- and self-information for higher-order relation prediction in Heterogeneous Information Networks

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jie Li , Xuan Guo , Pengfei Jiao , Wenjun Wang
{"title":"Learning accurate neighborhood- and self-information for higher-order relation prediction in Heterogeneous Information Networks","authors":"Jie Li ,&nbsp;Xuan Guo ,&nbsp;Pengfei Jiao ,&nbsp;Wenjun Wang","doi":"10.1016/j.neucom.2024.128739","DOIUrl":null,"url":null,"abstract":"<div><div>Heterogeneous Information Networks (HINs) are commonly employed to model complex real-world scenarios with diverse node and edge types. However, due to constraints in data collection and processing, constructed networks often lack certain relations. Consequently, various methods have emerged, particularly recently, leveraging heterogeneous graph neural networks (HGNNs) to predict missing relations. Nevertheless, these methods primarily focus on pairwise relations between two nodes. Real-world interactions, however, often involve multiple nodes and diverse types, extending beyond simple pairwise relations. For instance, academic collaboration networks may entail interactions among authors, papers, and conferences simultaneously. Despite their prevalence, higher-order relations are often overlooked. While HGNNs are effective at learning network structures, they may suffer from over-smoothing, resulting in similar representations for nodes and their neighbors. The learned inaccurate proximity among nodes impedes the discernment of higher-order relations. Furthermore, observed edges among a target group of nodes can provide valuable evidence for predicting higher-order relations. To address these challenges, we propose a novel model called Accurate Neighborhood- and Self-information Enhanced Heterogeneous Graph Neural Network (ANSE-HGN). Building upon HGNNs to encode network structure and attributes, we introduce a relation-based neighborhood encoder to capture information within multi-hop neighborhoods in heterogeneous higher-order relations. This enables the calculation of accurate proximity among target groups of nodes, thereby enhancing prediction accuracy. Additionally, we leverage self-information from observed higher-order relations as an auxiliary loss to reinforce the learning process. Extensive experiments on four real-world datasets demonstrate the superiority of our proposed method in higher-order relation prediction tasks.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":5.5000,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231224015108","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Heterogeneous Information Networks (HINs) are commonly employed to model complex real-world scenarios with diverse node and edge types. However, due to constraints in data collection and processing, constructed networks often lack certain relations. Consequently, various methods have emerged, particularly recently, leveraging heterogeneous graph neural networks (HGNNs) to predict missing relations. Nevertheless, these methods primarily focus on pairwise relations between two nodes. Real-world interactions, however, often involve multiple nodes and diverse types, extending beyond simple pairwise relations. For instance, academic collaboration networks may entail interactions among authors, papers, and conferences simultaneously. Despite their prevalence, higher-order relations are often overlooked. While HGNNs are effective at learning network structures, they may suffer from over-smoothing, resulting in similar representations for nodes and their neighbors. The learned inaccurate proximity among nodes impedes the discernment of higher-order relations. Furthermore, observed edges among a target group of nodes can provide valuable evidence for predicting higher-order relations. To address these challenges, we propose a novel model called Accurate Neighborhood- and Self-information Enhanced Heterogeneous Graph Neural Network (ANSE-HGN). Building upon HGNNs to encode network structure and attributes, we introduce a relation-based neighborhood encoder to capture information within multi-hop neighborhoods in heterogeneous higher-order relations. This enables the calculation of accurate proximity among target groups of nodes, thereby enhancing prediction accuracy. Additionally, we leverage self-information from observed higher-order relations as an auxiliary loss to reinforce the learning process. Extensive experiments on four real-world datasets demonstrate the superiority of our proposed method in higher-order relation prediction tasks.
为异构信息网络中的高阶关系预测学习准确的邻接信息和自身信息
异构信息网络(HIN)通常被用来模拟现实世界中具有不同节点和边缘类型的复杂场景。然而,由于数据收集和处理的限制,构建的网络往往缺乏某些关系。因此,特别是最近出现了各种利用异构图神经网络(HGNN)预测缺失关系的方法。不过,这些方法主要关注两个节点之间的配对关系。然而,现实世界中的互动往往涉及多个节点和多种类型,超越了简单的配对关系。例如,学术合作网络可能同时涉及作者、论文和会议之间的互动。尽管高阶关系普遍存在,但却经常被忽视。虽然 HGNN 在学习网络结构方面很有效,但它们可能会受到过度平滑的影响,导致节点及其相邻节点的表征相似。学习到的节点间不准确的邻近性阻碍了对高阶关系的识别。此外,观察到的目标节点组之间的边可以为预测高阶关系提供有价值的证据。为了应对这些挑战,我们提出了一种名为 "精确邻接和自信息增强异构图神经网络(ANSE-HGN)"的新模型。在 HGNN 编码网络结构和属性的基础上,我们引入了基于关系的邻域编码器,以捕捉异构高阶关系中多跳邻域内的信息。这样就能准确计算目标节点组之间的邻近度,从而提高预测准确性。此外,我们还利用观察到的高阶关系中的自我信息作为辅助损失来强化学习过程。在四个真实世界数据集上的广泛实验证明了我们提出的方法在高阶关系预测任务中的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
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学术官方微信