ShallowBKGC: a BERT-enhanced shallow neural network model for knowledge graph completion

被引:0
作者
Jia N. [1 ]
Yao C. [1 ]
机构
[1] School of Management and Engineering, Capital University of Economics and Business, Beijing
关键词
BERT; Knowledge graph; Knowledge graph completion; Neural network;
D O I
10.7717/PEERJ-CS.2058
中图分类号
学科分类号
摘要
Knowledge graph completion aims to predict missing relations between entities in a knowledge graph. One of the effective ways for knowledge graph completion is knowledge graph embedding. However, existing embedding methods usually focus on developing deeper and more complex neural networks, or leveraging additional information, which inevitably increases computational complexity and is unfriendly to real-time applications. In this article, we propose an effective BERT-enhanced shallow neural network model for knowledge graph completion named ShallowBKGC. Specifically, given an entity pair, we first apply the pre-trained language model BERT to extract text features of head and tail entities. At the same time, we use the embedding layer to extract structure features of head and tail entities. Then the text and structure features are integrated into one entity-pair representation via average operation followed by a non-linear transformation. Finally, based on the entity-pair representation, we calculate probability of each relation through multi-label modeling to predict relations for the given entity pair. Experimental results on three benchmark datasets show that our model achieves a superior performance in comparison with baseline methods. The source code of this article can be obtained from https://github.com/Joni-gogogo/ShallowBKGC. © (2024), Jia and Yao
引用
收藏
页码:1 / 19
页数:18
相关论文
共 58 条
  • [1] Auer S, Bizer C, Kobilarov G, Lehmann J, Cyganiak R, Ives Z., DBpedia: a nucleus for a web of open data, The Semantic Web, pp. 722-735, (2007)
  • [2] Ba J, Caruana R., Do deep nets really need to be deep?, Advances in Neural Information Processing Systems, 27, pp. 2654-2662, (2014)
  • [3] Balazevic I, Allen C, Hospedales T., TucKER: tensor factorization for knowledge graph completion, Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLPIJCNLP), pp. 5185-5194, (2019)
  • [4] Bollacker K, Evans C, Paritosh P, Sturge T, Taylor J., Freebase: a collaboratively created graph database for structuring human knowledge, Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 1247-1250, (2008)
  • [5] Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O., Translating embeddings for modeling multi-relational data, Advances in Neural Information Processing Systems, 26, pp. 2787-2795, (2013)
  • [6] Bordes A, Weston J, Collobert R, Bengio Y., Learning structured embeddings of knowledge bases, Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, (2011)
  • [7] Carlson A, Betteridge J, Kisiel B, Settles B, Hruschka ER, Mitchell TM., Toward an architecture for never-ending language learning, Twenty-Fourth AAAI Conference on Artificial Intelligence, (2010)
  • [8] Dai Quoc Nguyen TDN, Nguyen DQ, Phung D., A novel embedding model for knowledge base completion based on convolutional neural network, Proceedings of NAACL-HLT, pp. 327-333, (2018)
  • [9] Demir C, Moussallem D, Ngomo A-CN., A shallow neural model for relation prediction, IEEE 15th International Conference on Semantic Computing, pp. 179-182, (2021)
  • [10] Demir C, Ngomo AN., Out-of-vocabulary entities in link prediction, CoRR, (2021)