Preserving overlapped information via parallel one-hop and multi-hop neighbor encoding for knowledge graph entity typing

IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Hongbin Zhang , Zhenghao Huang , Ruihao Li , Tao Wang , Zhuowei Wang , Lianglun Cheng
{"title":"Preserving overlapped information via parallel one-hop and multi-hop neighbor encoding for knowledge graph entity typing","authors":"Hongbin Zhang ,&nbsp;Zhenghao Huang ,&nbsp;Ruihao Li ,&nbsp;Tao Wang ,&nbsp;Zhuowei Wang ,&nbsp;Lianglun Cheng","doi":"10.1016/j.ipm.2025.104385","DOIUrl":null,"url":null,"abstract":"<div><div>Knowledge graph entity typing (KGET) is critical for predicting and completing missing entity types in a knowledge graph (KG). Existing KGET models mainly aggregate local semantic and structural information from multi-hop and one-hop neighbors via weighted aggregation. However, the one-hop neighbor information within the multi-hop neighbor context is often diluted during aggregation, resulting in incomplete information collection and inaccurate type prediction. To preserve this overlapped one-hop neighbor information, we propose a novel framework, the one-hop and multi-hop neighbor parallel encoding framework (OMNPEF), which captures local-to-global semantic and structural information. Specifically, OMNPEF encodes one-hop and multi-hop neighbors in parallel to better preserve the overlapped one-hop neighbor information and integrates local information with global semantic and structural insights, enhancing the model’s capacity to learn from the graph structure. Experimental results on the FB15kET and YAGO43kET datasets demonstrate that OMNPEF outperforms state-of-the-art models, achieving a mean improvement of at least 1.3% in MRR.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 2","pages":"Article 104385"},"PeriodicalIF":6.9000,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457325003267","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Knowledge graph entity typing (KGET) is critical for predicting and completing missing entity types in a knowledge graph (KG). Existing KGET models mainly aggregate local semantic and structural information from multi-hop and one-hop neighbors via weighted aggregation. However, the one-hop neighbor information within the multi-hop neighbor context is often diluted during aggregation, resulting in incomplete information collection and inaccurate type prediction. To preserve this overlapped one-hop neighbor information, we propose a novel framework, the one-hop and multi-hop neighbor parallel encoding framework (OMNPEF), which captures local-to-global semantic and structural information. Specifically, OMNPEF encodes one-hop and multi-hop neighbors in parallel to better preserve the overlapped one-hop neighbor information and integrates local information with global semantic and structural insights, enhancing the model’s capacity to learn from the graph structure. Experimental results on the FB15kET and YAGO43kET datasets demonstrate that OMNPEF outperforms state-of-the-art models, achieving a mean improvement of at least 1.3% in MRR.
基于并行单跳和多跳邻居编码的知识图实体类型信息保留
知识图实体类型(KGET)是预测和补全知识图中缺失实体类型的关键。现有的KGET模型主要通过加权聚合方式从多跳和单跳邻居中聚合局部语义和结构信息。然而,在聚合过程中,多跳邻居上下文中的单跳邻居信息经常被稀释,导致信息收集不完整和类型预测不准确。为了保留这种重叠的一跳邻居信息,我们提出了一种新的框架,即一跳和多跳邻居并行编码框架(OMNPEF),该框架捕获局部到全局的语义和结构信息。具体来说,OMNPEF对一跳和多跳邻居进行并行编码,更好地保留重叠的一跳邻居信息,并将局部信息与全局语义和结构洞察相结合,增强了模型从图结构中学习的能力。在FB15kET和YAGO43kET数据集上的实验结果表明,OMNPEF优于最先进的模型,MRR平均提高了至少1.3%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
×
引用
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学术官方微信