Semantic-Enhanced Knowledge Graph Completion
-
Published:2024-01-31
Issue:3
Volume:12
Page:450
-
ISSN:2227-7390
-
Container-title:Mathematics
-
language:en
-
Short-container-title:Mathematics
Author:
Yuan Xu1, Chen Jiaxi1, Wang Yingbo1ORCID, Chen Anni2, Huang Yiou3, Zhao Wenhong4ORCID, Yu Shuo5
Affiliation:
1. School of Software, Dalian University of Technology, Dalian 116620, China 2. School of Computer Science, University of Wollongong, Wollongong 2522, Australia 3. School of Mathematics and Physics, Xi’an Jiaotong-Liverpool University, Suzhou 215123, China 4. Ultraprecision Machining Center, Zhejiang University of Technology, Hangzhou 310014, China 5. School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China
Abstract
Knowledge graphs (KGs) serve as structured representations of knowledge, comprising entities and relations. KGs are inherently incomplete, sparse, and have a strong need for completion. Although many knowledge graph embedding models have been designed for knowledge graph completion, they predominantly focus on capturing observable correlations between entities. Due to the sparsity of KGs, potential semantic correlations are challenging to capture. To tackle this problem, we propose a model entitled semantic-enhanced knowledge graph completion (SE-KGC). SE-KGC effectively addresses the issue by incorporating predefined semantic patterns, enabling the capture of semantic correlations between entities and enhancing features for representation learning. To implement this approach, we employ a multi-relational graph convolution network encoder, which effectively encodes the KG. Subsequently, we utilize a scoring decoder to evaluate triplets. Experimental results demonstrate that our SE-KGC model outperforms other state-of-the-art methods in link-prediction tasks across three datasets. Specifically, compared to the baselines, SE-KGC achieved improvements of 11.7%, 1.05%, and 2.30% in terms of MRR on these three datasets. Furthermore, we present a comprehensive analysis of the contributions of different semantic patterns, and find that entities with higher connectivity play a pivotal role in effectively capturing and characterizing semantic information.
Funder
Bintuan Science and Technology Program Fundamental Research Funds for the Central Universities “High-level Talent Team” Project of Dalian Science and Technology Talent Innovation Support Policy Program
Reference45 articles.
1. Wang, J., Shi, Y., Yu, H., Wang, X., Yan, Z., and Kong, F. (2023, January 23–27). Mixed-Curvature Manifolds Interaction Learning for Knowledge Graph-aware Recommendation. Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, Taipei, Taiwan. 2. Learning from Hierarchical Structure of Knowledge Graph for Recommendation;Qin;ACM Trans. Inf. Syst.,2024 3. Wu, T., Bai, X., Guo, W., Liu, W., Li, S., and Yang, Y. (March, January 27). Modeling Fine-grained Information via Knowledge-aware Hierarchical Graph for Zero-shot Entity Retrieval. Proceedings of the 16th ACM International Conference on Web Search and Data Mining, Singapore. 4. Zhou, Y., Chen, X., He, B., Ye, Z., and Sun, L. (2022, January 11–15). Re-thinking Knowledge Graph Completion Evaluation from an Information Retrieval Perspective. Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, Madrid, Spain. 5. Liu, L., Chen, Y., Das, M., Yang, H., and Tong, H. (May, January 30). Knowledge Graph Question Answering with Ambiguous Query. Proceedings of the ACM Web Conference 2023, Austin, TX, USA.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|