Skip to main content
Log in

BDRI: block decomposition based on relational interaction for knowledge graph completion

  • Published:
Data Mining and Knowledge Discovery Aims and scope Submit manuscript

Abstract

Knowledge graphs (KGs) are large-scale semantic networks designed to describe real-world facts. However, existing KGs typically contain only a small subset of all possible facts. Knowledge graph completion (KGC) is a task of inferring missing facts based on existing facts, which can help KGs become more complete. Tensor decomposition algorithms have proved promising for KGC problems. In this paper, we propose block decomposition based on relational interaction for knowledge graph completion (BDRI), a novel and robust model based on block term decomposition of the binary tensor representation of knowledge graph triples. Further, BDRI considers that the inverse relation, as one of the most important relation types, not only occupies a large proportion in real-world facts but also has an impact on other relation types. Although some existing models also take into account the importance of inverse relations, it is not enough to learn inverse relations independently. BDRI strengthens the fusion of forward relations and inverse relations by introducing inverse relations into the model in an enhanced way. We prove BDRI is full expressiveness and derive the bound on its entity and relation embedding dimensionality and smaller than the bound of SimplE and ComplEx. Experimental results on five public datasets show the effectiveness of BDRI.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Auer S, Bizer C, Kobilarov G, Lehmann J, Cyganiak R, Ives Z (2007) DBpedia: a nucleus for a web of open data. In: Aberer K, Choi K-S, Noy N, Allemang D, Lee K-I, Nixon L, Golbeck J, Mika P, Maynard D, Mizoguchi R, Schreiber G, Cudré-Mauroux P (eds) The semantic web. Springer, Berlin, Heidelberg, pp 722–735

    Chapter  Google Scholar 

  • Balazevic I, Allen C, Hospedales TM (2019) TuckER: tensor factorization for knowledge graph completion. In: Inui K, Jiang J, Ng V, Wan X (eds) Proceedings of the 2019 conference on empirical methods in natural language processing and the 9th international joint conference on natural language processing, EMNLP-IJCNLP 2019, pp 5184–5193. Association for Computational Linguistics Hong Kong, China. https://doi.org/10.18653/v1/D19-1522

  • Bollacker K, Evans C, Paritosh P, Sturge T, Taylor J (2008) Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data. SIGMOD ’08, pp 1247–1250. Association for Computing Machinery New York, NY, USA . https://doi.org/10.1145/1376616.1376746

  • Bordes A, Usunier N, García-Durán A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. In: Burges C.J.C, Bottou L, Ghahramani Z, Weinberger KQ (eds) Advances in neural information processing systems 26: 27th Annual Conference on Neural Information Processing Systems, NeurIPS 2013 Lake Tahoe, Nevada, United States, pp 2787–2795

  • Cao Y, Wang X, He X, Hu Z, Chua T-S (2019) Unifying knowledge graph learning and recommendation: towards a better understanding of user preferences. In: The World Wide Web Conference, WWW 2019, pp 151–161. Association for Computing Machinery New York, NY, USA. https://doi.org/10.1145/3308558.3313705

  • Cao Z, Xu Q, Yang Z, Cao X, Huang Q (2021) Dual quaternion knowledge graph embeddings. In: Thirty-Fifth AAAI conference on artificial intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The eleventh symposium on educational advances in artificial intelligence, EAAI 2021, pp 6894–6902. AAAI Press Virtual Event . https://doi.org/10.1609/aaai.v35i8.16850

  • Carlson A, Betteridge J, Kisiel B, Settles B, Jr. ERH, Mitchell TM (2010) Toward an architecture for never-ending language learning. In: Fox M, Poole D (eds) Proceedings of the twenty-fourth AAAI conference on artificial intelligence, AAAI 2010, pp 1306–1313. AAAI Press Atlanta, Georgia, USA

  • Cui Z, Kapanipathi P, Talamadupula K, Gao T, Ji Q (2021) Type-augmented relation prediction in knowledge graphs. In: Thirty-Fifth AAAI conference on artificial intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, pp 7151–7159. AAAI Press Virtual Event . https://doi.org/10.1609/aaai.v35i8.16879

  • Dettmers T, Minervini P, Stenetorp P, Riedel S (2018) Convolutional 2D knowledge graph embeddings. In: McIlraith S.A, Weinberger KQ (eds) Proceedings of the Thirty-Second AAAI conference on artificial intelligence, AAAI 2018, the 30th Innovative Applications of Artificial Intelligence, IAAI-2018, and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2018, pp 1811–1818. AAAI Press New Orleans, Louisiana, USA

  • Dong X, Gabrilovich E, Heitz G, Horn W, Lao N, Murphy K, Strohmann T, Sun S, Zhang W (2014) Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD 2014, pp. 601–610. Association for Computing Machinery New York, NY, USA. https://doi.org/10.1145/2623330.2623623

  • Hao Y, Zhang Y, Liu K, He S, Liu Z, Wu H, Zhao J (2017) An end-to-end model for question answering over knowledge base with cross-attention combining global knowledge. In: Proceedings of the 55th annual meeting of the association for computational linguistics, ACL 2017, (Volume 1: Long Papers), pp 221–231. Association for Computational Linguistics Vancouver, Canada. https://doi.org/10.18653/v1/P17-1021

  • He H, Balakrishnan A, Eric M, Liang P (2017) learning symmetric collaborative dialogue agents with dynamic knowledge graph embeddings. In: Proceedings of the 55th annual meeting of the association for computational linguistics, ACL 2017, (Volume 1: Long Papers), pp 1766–1776. Association for Computational Linguistics Vancouver, Canada. https://doi.org/10.18653/v1/P17-1162

  • Hitchcock FL (1927) The expression of a tensor or a polyadic as a sum of products. J Math Phys 6(1–4):164–189

    Article  MATH  Google Scholar 

  • Ioffe S, Szegedy C (2015) Batch normalization: accelerating deep network training by reducing internal covariate shift. In: Bach FR, Blei DM (eds) Proceedings of the 32nd international conference on machine learning, ICML 2015. JMLR Workshop and Conference Proceedings, vol 37, pp 448–456. JMLR.org Lille, France

  • Ji G, He S, Xu L, Liu K, Zhao J (2015) Knowledge graph embedding via dynamic mapping matrix. In: Proceedings of the 53rd Annual meeting of the association for computational linguistics and the 7th International Joint Conference on Natural Language Processing, ACL 2015, (Volume 1: Long Papers), pp 687–696. Association for Computational Linguistics Beijing, China. https://doi.org/10.3115/v1/P15-1067

  • Ji G, Liu K, He S, Zhao J (2016) Knowledge graph completion with adaptive sparse transfer matrix. In: Schuurmans D, Wellman MP (eds) Proceedings of the Thirtieth AAAI conference on artificial intelligence, AAAI 2016, pp 985–991. AAAI Press Phoenix, Arizona, USA

  • Kazemi SM, Poole D (2018) SimplE embedding for link prediction in knowledge graphs. In: Bengio S, Wallach HM, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R (eds) Advances in neural information processing systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018 Montréal, Canada, pp 4289–4300

  • Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. In: Bengio Y, LeCun Y (eds) 3rd international conference on learning representations, ICLR 2015 San Diego. CA, USA

  • Lacroix T, Usunier N, Obozinski G (2018) Canonical tensor decomposition for knowledge base completion. In: Dy JG, Krause A (eds) Proceedings of the 35th international conference on machine learning, ICML 2018. Proceedings of Machine Learning Research, vol 80, pp 2869–2878. PMLR Stockholmsmässan, Stockholm, Sweden

  • Lathauwer LD (2008) Decompositions of a higher-order tensor in block terms - Part II: definitions and uniqueness. SIAM J Matrix Anal Appl 30(3):1033–1066. https://doi.org/10.1137/070690729

    Article  MathSciNet  MATH  Google Scholar 

  • Li Z, Zhao Y, Zhang Y, Zhang Z (2022) Multi-relational graph attention networks for knowledge graph completion. Knowl-Based Syst 251:109–262. https://doi.org/10.1016/j.knosys.2022.109262

    Article  Google Scholar 

  • Lin Y, Liu Z, Sun M, Liu Y, Zhu X (2015) Learning entity and relation embeddings for knowledge graph completion. In: Bonet B, Koenig S (eds) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI 2015, pp 2181–2187. AAAI Press Austin, Texas, USA

  • Nguyen DQ, Sirts K, Qu L, Johnson M (2016) STransE: a novel embedding model of entities and relationships in knowledge bases. In: Proceedings of the 2016 Conference of the North American chapter of the association for computational linguistics: human language technologies, ACL 2016, pp 460–466. Association for Computational Linguistics San Diego, California. https://doi.org/10.18653/v1/N16-1054

  • Nguyen DQ, Vu T, Nguyen TD, Phung D (2022) QuatRE: Relation-aware quaternions for knowledge graph embeddings. In: Companion proceedings of the web conference 2022. WWW ’22, pp 189–192. Association for Computing Machinery New York, NY, USA . https://doi.org/10.1145/3487553.3524251

  • Nickel M, Murphy K, Tresp V, Gabrilovich E (2016) A review of relational machine learning for knowledge graphs. Proc IEEE 104(1):11–33. https://doi.org/10.1109/JPROC.2015.2483592

    Article  Google Scholar 

  • Nickel M, Tresp V, Kriegel H (2011) A three-way model for collective learning on multi-relational data. In: Getoor L, Scheffer T (eds) Proceedings of the 28th international conference on machine learning, ICML 2011, vol 11, pp 809–816. Omnipress Bellevue, Washington, USA

  • Sang S, Yang Z, Wang L, Liu X, Lin H, Wang J (2018) SemaTyP: a knowledge graph based literature mining method for drug discovery. BMC Bioinform 19(1):1–11. https://doi.org/10.1186/s12859-018-2167-5

    Article  Google Scholar 

  • Socher R, Chen D, Manning C.D, Ng A.Y (2013) Reasoning with neural tensor networks for knowledge base completion. In: Burges CJC, Bottou L, Ghahramani Z, Weinberger KQ (eds) Advances in neural information processing systems 26: 27th Annual Conference on Neural Information Processing Systems, NeurIPS 2013. Lake Tahoe, Nevada, United States, pp. 926–934

  • Srivastava N, Hinton GE, Krizhevsky A, Sutskever I, Salakhutdinov R (2014) Dropout: a simple way to prevent neural networks from overfitting. J Mach Learn Res 15(1):1929–1958. https://doi.org/10.5555/2627435.2670313

    Article  MathSciNet  MATH  Google Scholar 

  • Suchanek FM, Kasneci G, Weikum G (2007) Yago: a core of semantic knowledge. In: Williamson CL, Zurko ME, Patel-Schneider PF, Shenoy PJ (eds) Proceedings of the 16th International Conference on World Wide Web, WWW 2007, pp 697–706. ACM Banff, Alberta, Canada. https://doi.org/10.1145/1242572.1242667

  • Sun Z, Deng Z, Nie J, Tang J (2019) RotatE: knowledge graph embedding by relational rotation in complex space. In: 7th international conference on learning representations, ICLR 2019. OpenReview.net New Orleans, LA, USA

  • Tang Y, Huang J, Wang G, He X, Zhou B (2020) Orthogonal relation transforms with graph context modeling for knowledge graph embedding. In: Jurafsky D, Chai J, Schluter N, Tetreault JR (eds) Proceedings of the 58th annual meeting of the association for computational linguistics, ACL 2020, pp. 2713–2722. Association for Computational Linguistics Online . https://doi.org/10.18653/v1/2020.acl-main.241

  • Toutanova K, Chen D, Pantel P, Poon H, Choudhury P, Gamon M (2015) Representing text for joint embedding of text and knowledge bases. In: Proceedings of the 2015 conference on empirical methods in natural language processing, EMNLP 2015, pp. 1499–1509. Association for Computational Linguistics Lisbon, Portugal . https://doi.org/10.18653/v1/D15-1174

  • Trouillon T, Welbl J, Riedel S, Gaussier É, Bouchard G (2016) Complex embeddings for simple link prediction. In: Balcan M, Weinberger KQ (eds) Proceedings of the 33nd international conference on machine learning, ICML 2016. JMLR Workshop and Conference Proceedings, vol. 48, pp. 2071–2080. JMLR.org New York, NY, USA

  • Tucker LR et al (1964) The extension of factor analysis to three-dimensional matrices. Contrib Math Psychol 110119

  • Vashishth S, Sanyal S, Nitin V, Agrawal N, Talukdar PP (2020) InteractE: improving convolution-based knowledge graph embeddings by increasing feature interactions. In: The Thirty-Fourth AAAI conference on artificial intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, pp. 3009–3016. AAAI Press New York, NY, USA . https://doi.org/10.1609/aaai.v34i03.5694

  • Wang Z, Zhang J, Feng J, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes. In: Brodley CE, Stone P (eds) Proceedings of the Twenty-Eighth AAAI conference on artificial intelligence, AAAI 2014, pp 1112–1119. AAAI Press Québec City, Québec, Canada

  • Wang F, Zhang Z, Sun L, Ye J, Yan Y (2022) DiriE: knowledge graph embedding with dirichlet distribution. In: Proceedings of the ACM web conference, ACM 2022, pp 3082–3091. Association for Computing Machinery New York, NY, USA. https://doi.org/10.1145/3485447.3512028

  • Xiao H, Huang M, Zhu X (2016) TransG : a generative model for knowledge graph embedding. In: Proceedings of the 54th Annual meeting of the association for computational linguistics, ACL 2016, (Volume 1: Long Papers), pp 2316–2325. Association for Computational Linguistics Berlin, Germany . https://doi.org/10.18653/v1/P16-1219

  • Xie Z, Zhu R, Liu J, Zhou G, Huang JX (2021) Hierarchical neighbor propagation with bidirectional graph attention network for relation prediction. IEEE ACM Trans Audio Speech Lang Process 2:1762–1773. https://doi.org/10.1109/TASLP.2021.3079812

    Article  Google Scholar 

  • Yang B, Mitchell T (2017) Leveraging knowledge bases in LSTMs for improving machine reading. In: Proceedings of the 55th annual meeting of the association for computational linguistics, ACL 2017, (Volume 1: Long Papers), pp 1436–1446. Association for Computational Linguistics Vancouver, Canada. https://doi.org/10.18653/v1/P17-1132

  • Yang B, Yih W, He X, Gao J, Deng L (2015) Embedding entities and relations for learning and inference in knowledge bases. In: Bengio Y, LeCun Y (eds) 3rd international conference on learning representations, ICLR 2015 San Diego. CA, USA

  • Zeb A, Ul Haq A, Zhang D, Chen J, Gong Z (2021) KGEL: a novel end-to-end embedding learning framework for knowledge graph completion. Expert Syst Appl 167:114–164. https://doi.org/10.1016/j.eswa.2020.114164

    Article  Google Scholar 

  • Zhang S, Tay Y, Yao L, Liu Q (2019) Quaternion knowledge graph embeddings. In: Wallach HM, Larochelle H, Beygelzimer A, d’Alché-Buc F, Fox EB, Garnett R (eds) Advances in neural information processing systems 32: Annual Conference on Neural Information Processing Systems, NeurIPS 2019 Vancouver. BC, Canada, pp 2731–2741

Download references

Acknowledgements

This work is jointly supported by National Natural Science Foundation of China (61877043) and National Natural Science of China (61877044).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xuewei Li.

Ethics declarations

Conflict of interest

The authors declare that they have no known competingfinancial interests or personal relationships that could haveappeared to influence the work reported in this paper.

Additional information

Responsible editor: Jingrui He.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, M., Guo, J., Yu, J. et al. BDRI: block decomposition based on relational interaction for knowledge graph completion. Data Min Knowl Disc 37, 767–787 (2023). https://doi.org/10.1007/s10618-023-00918-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10618-023-00918-8

Keywords

Navigation