快速访问

查看PDF

文章信息

参考文献

[1]ZAMINI M, REZA H, RABIEI M. A review of knowledge graph completion [J]. Information, 2022, 13(8): 396. DOI: 10.3390/info13080396.
[2]BALAZEVIC I, ALLEN C, HOSPEDALES T M. TuckER: tensor factorization for knowledge graph completion [C]//Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). Hong Kong: Association for Computational Linguistics, 2019: 5185-5194. DOI: 10.18653/v1/D19-1522.
[3]BORDES A, USUNIER N, GARCIA-DURÁN A, et al. Translating embeddings for modeling multi-relational data [C]//Advances in Neural Information Processing Systems 26 (NIPS 2013). Lake Tahoe: Curran Associates, Inc., 2013: 2787-2795.
[4]WANG L, ZHAO W, WEI Z, et al. SimKGC: simple contrastive knowledge graph completion with pre-trained language models [C]//Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Dublin: Association for Computational Linguistics, 2022: 4281-4294. DOI: 10.18653/v1/2022.acl-long.295.
[5]QIAO Z, YE W, YU D, et al. Improving knowledge graph completion with generative hard negative mining [C]//Findings of the Association for Computational Linguistics: ACL 2023. Toronto: Association for Computational Linguistics, 2023: 5866-5878. DOI: 10.18653/v1/2023.findings-acl.362.
[6]WANG Z, ZHANG J, FENG J, et al. Knowledge graph embedding by translating on hyperplanes [C]//Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-14). Québec City: AAAI Press, 2014: 1112-1119. DOI: 10.1609/aaai.v28i1.8870.
[7]JI G, HE S, XU L, et al. Knowledge graph embedding via dynamic mapping matrix [C]//Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). Beijing: Association for Computational Linguistics, 2015: 687-696.
[8]SUN Z, DENG Z H, NIE J Y, et al. RotatE: knowledge graph embedding by relational rotation in complex space [C]//International Conference on Learning Representations (ICLR 2019). New Orleans: ICLR, 2019.
[9]DETTMERS T, MINERVINI P, STENETORP P, et al. Convolutional 2D knowledge graph embeddings [C]//Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18). New Orleans: AAAI Press, 2018: 1811-1819. DOI: 10.1609/aaai.v32i1.11573.
[10]NATHANI D, CHAUHAN J, SHARMA C, et al. Learning attention-based embeddings for relation prediction in knowledge graphs [C]//Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics (ACL 2019). Florence: Association for Computational Linguistics, 2019: 4710-4723.
[11]CHEN C, WANG Y, SUN A, et al. Dipping PLMs sauce: bridging structure and text for effective knowledge graph completion via conditional soft prompting [C]//Findings of the Association for Computational Linguistics: ACL 2023. Toronto: Association for Computational Linguistics, 2023: 11489-11503.
[12]YANG B, YIH W T, HE X, et al. Embedding entities and relations for learning and inference in knowledge bases [C]//3rd International Conference on Learning Representations (ICLR 2015). San Diego: ICLR, 2015. DOI: 10.48550/arXiv.1412.6575.
[13]SCHLICHTKRULL M, KIPF T N, BLOEM P, et al. Modeling relational data with graph convolutional networks [C]//The Semantic Web: 15th International Conference, ESWC 2018. Heraklion: Springer, 2018: 1-17. DOI: 10.1007/978-3-319-93417-4_1.
[14]VASHISHTH S, SANYAL S, NITIN V, et al. Composition-based multi-relational graph convolutional networks [C]//8th International Conference on Learning Representations (ICLR 2020). Addis Ababa: ICLR, 2020.
[15]ZHANG S, TAY Y, YAO L, et al. Quaternion knowledge graph embeddings [C]//Advances in Neural Information Processing Systems 32 (NeurIPS 2019). Vancouver: Curran Associates, Inc., 2019: 2731-2741.
[16]YAO L, MAO C, LUO Y. KG-BERT: BERT for knowledge graph completion [J/OL]. arXiv preprint, 2019. arXiv: 1909.03193. https: //arxiv.org/abs/1909.03193.

版权与开放获取声明

作为一本开放获取的学术期刊,所有文章均遵循 Creative Commons Attribution 4.0 International License (CC BY 4.0) 协议发布,允许用户在署名原作者的前提下自由共享与再利用内容。所有文章均可免费供读者和机构阅读、下载、引用与传播,EWA Publishing 不会通过期刊的出版发行向读者或机构收取任何费用。