TBDRI: block decomposition based on relational interaction for temporal knowledge graph completion | Applied Intelligence Skip to main content
Springer Nature Link
Log in

TBDRI: block decomposition based on relational interaction for temporal knowledge graph completion

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Knowledge graph completion (KGC) can be interpreted as the task of missing inferences to real-world facts. Despite the importance and abundance of temporal knowledge graphs, most of the current research has been focused on reasoning on static knowledge graphs. The data they are applied to usually evolves with time, such as friend graphs in social networks. Therefore, developing temporal knowledge graph completion (temporal KGC) models is an increasingly important topic, although it is difficult due to data non-stationarity, and its complex temporal dependencies. In this paper, we propose block decomposition based on relational interaction for temporal knowledge graph completion (TBDRI), a novel model based on block term decomposition (which can be seen as a special variant of CP decomposition and Tucker decomposition) of the binary tensor representation of knowledge graph quadruples. TBDRI considers that inverse relations, as one of the most important types of relations, occupy an important share in the real world. Although some existing models introduce inverse relation into the model, it is not enough to only learn the inverse relation independently. TBDRI learns inverse relation in an enhanced way to strengthen the binding of forward and inverse relation. Furthermore, TBDRI first uses the core tensor as temporal information to bind timestamps more adequately. We prove TBDRI is full expressiveness and derive the bound on its entity, relation, and timestamp embedding dimensionality. We show that TBDRI is able to outperform most previous state-of-the-art models on the four benchmark datasets for temporal knowledge graph completion.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. 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:114164

    Article  Google Scholar 

  2. 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

    Article  Google Scholar 

  3. 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, pp 151–161

  4. 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 (Volume 1: Long Papers), pp 1436–1446

  5. 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 (Volume 1: Long Papers), pp 221–231

  6. 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, pp 1247–1250

  7. Auer S, Bizer C, Kobilarov G, Lehmann J, Cyganiak R, Ives Z (2007) Dbpedia: A nucleus for a web of open data. In: The semantic web. Springer, pp 722–735

  8. Carlson A, Betteridge J, Kisiel B, Settles B, Hruschka E R, Mitchell T M (2010) Toward an architecture for never-ending language learning. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI’10. AAAI Press, pp 1306–1313

  9. Blog GO (2012) Introducing the knowledge graph: thing, not strings. Introducing the Knowledge Graph: things, not strings

  10. Yates A, Banko M, Broadhead M, Cafarella M J, Etzioni O, Soderland S (2007) Textrunner: open information extraction on the web. In: Proceedings of Human Language Technologies: The Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL-HLT), pp 25–26

  11. Suchanek F M, Kasneci G, Weikum G (2007) Yago: a core of semantic knowledge. In: Proceedings of the 16th international conference on World Wide Web, pp 697–706

  12. Burgun A, Bodenreider O (2001) Comparing terms, concepts and semantic classes in wordnet and the unified medical language system. In: Proceedings of the NAACL’2001 Workshop, WordNet and Other Lexical Resources: Applications, Extensions and Customizations, pp 77–82

  13. García-Durãn A, Dumani S, Niepert M (2018) Learning sequence encoders for temporal knowledge graph completion. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing

  14. Zhu Q, Zhou X, Zhang P, Shi Y (2019) A neural translating general hyperplane for knowledge graph embedding. Journal of Computational Science

  15. De Lathauwer L (2008) Decompositions of a higher-order tensor in block terms-part ii: Definitions and uniqueness. SIAM J Matrix Anal Appl 30(3):1033–1066

    Article  MathSciNet  MATH  Google Scholar 

  16. García-Durán A, Dumancic S, Niepert M (2018) Learning sequence encoders for temporal knowledge graph completion. In: EMNLP

  17. Goel R, Kazemi S M, Brubaker M, Poupart P (2020) Diachronic embedding for temporal knowledge graph completion. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 34, pp 3988–3995

  18. Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. Adv Neural Inf Process Syst 26:2787–2795

    Google Scholar 

  19. Vashishth S, Sanyal S, Nitin V, Agrawal N, Talukdar P P (2020) Interacte: Improving convolution-based knowledge graph embeddings by increasing feature interactions.. In: AAAI, pp 3009–3016

  20. Wang Z, Zhang J, Feng J, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 28

  21. Lin Y, Liu Z, Sun M, Liu Y, Zhu X (2015) Learning entity and relation embeddings for knowledge graph completion. In: Twenty-ninth AAAI conference on artificial intelligence

  22. Nickel M, Tresp V, Kriegel H-P (2011) A three-way model for collective learning on multi-relational data.. In: Icml, vol 11, pp 809–816

  23. Yang B, Yih S W-, He X, Gao J, Deng L (2015) Embedding entities and relations for learning and inference in knowledge bases

  24. Trouillon T, Welbl J, Riedel S, Gaussier E, Bouchard G (2016) Complex embeddings for simple link prediction. International Conference on Machine Learning (ICML)

  25. Balažević I, Allen C, Hospedales T (2019) Tucker: Tensor factorization for knowledge graph completion. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pp 5185–5194

  26. Tucker L R, et al. (1964) The extension of factor analysis to three-dimensional matrices. Contrib Math Psychol 110119

  27. Jiang T, Liu T, Ge T, Sha L, Chang B, Li S, Sui Z (2016) Towards time-aware knowledge graph completion. In: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, pp 1715–1724

  28. Bader B W, Harshman R A, Kolda T G (2007) Temporal analysis of semantic graphs using asalsan. In: Seventh IEEE international conference on data mining (ICDM 2007). IEEE, pp 33–42

  29. Lacroix T, Obozinski G, Usunier N (2020) Tensor decompositions for temporal knowledge base completion. stat 1050:10

    Google Scholar 

  30. Zhu C, Chen M, Fan C, Cheng G, Zhang Y (2021) Learning from history: Modeling temporal knowledge graphs with sequential copy-generation networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 35, pp 4732–4740

  31. Xu C, Nayyeri M, Alkhoury F, Yazdi H, Lehmann J Temporal knowledge graph embedding model based on additive time series decomposition

  32. Xu C, Chen Y-Y, Nayyeri M, Lehmann J (2021) Temporal knowledge graph completion using a linear temporal regularizer and multivector embeddings. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp 2569–2578

  33. Sadeghian A, Armandpour M, Colas A, Wang D Z (2021) Chronor: Rotation based temporal knowledge graph embedding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 35, pp 6471–6479

  34. Tang Y, Huang J, Wang G, He X, Zhou B (2020) Orthogonal relation transforms with graph context modeling for knowledge graph embedding. In: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, pp 2713–2722

  35. Kazemi S M, Poole D (2018) Simple embedding for link prediction in knowledge graphs. In: Advances in neural information processing systems, pp 4284–4295

  36. Kolda T G, Bader B W (2009) Tensor decompositions and applications. SIAM Rev 51 (3):455–500

    Article  MathSciNet  MATH  Google Scholar 

  37. Dettmers T, Minervini P, Stenetorp P, Riedel S (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 32

  38. Nickel M, Murphy K, Tresp V, Gabrilovich E (2015) A review of relational machine learning for knowledge graphs. Proc IEEE 104(1):11–33

    Article  Google Scholar 

  39. Kingma DP, Ba J (2015) Adam: A method for stochastic optimization in: Proceedings of international conference on learning representations. San Diego:[sn]

  40. Ward M D, Beger A, Cutler J, Dickenson M, Dorff C, Radford B (2013) Comparing gdelt and icews event data. Analysis 21(1):267–297

    Google Scholar 

  41. Boschee E, Lautenschlager J, O’Brien S, Shellman S, Starz J, Ward M (2015) Icews coded event data. Harvard Dataverse 12

  42. Trivedi R, Dai H, Wang Y, Song L (2017) Know-evolve: Deep temporal reasoning for dynamic knowledge graphs. In: Precup D, Teh Y W (eds) Proceedings of the 34th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol 70. PMLR, pp 3462–3471

  43. Ioffe S, Szegedy C (2015) Batch normalization: accelerating deep network training by reducing internal covariate shift. In: Proceedings of the 32nd International Conference on International Conference on Machine Learning-Volume 37, pp 448–456

  44. Srivastava N, Hinton G, 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

    MathSciNet  MATH  Google Scholar 

  45. Lacroix T, Obozinski G, Usunier N (2020) Tensor decompositions for temporal knowledge base completion. ICLR

  46. Xu C, Nayyeri M, Alkhoury F, Yazdi S H, Lehmann J (2020) Tero: A time-aware knowledge graph embedding via temporal rotation. COLING:1583–1593

  47. Wu J, Cao M, Cheung C K J, Hamilton L W (2020) Temp: Temporal message passing for temporal knowledge graph completion. EMNLP 2020:5730–5746

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

  1. College of Intelligence and Computing, Tianjin University, Tianjin, China

    Mei Yu, Jiujiang Guo, Jian Yu, Tianyi Xu, Mankun Zhao, Xuewei Li & Ruiguo Yu

  2. Tianjin Key Laboratory of Advanced Networking (TANKLab), Tianjin, China

    Mei Yu, Jiujiang Guo, Jian Yu, Tianyi Xu, Mankun Zhao, Xuewei Li & Ruiguo Yu

  3. Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin, China

    Mei Yu, Jiujiang Guo, Jian Yu, Tianyi Xu, Mankun Zhao, Xuewei Li & Ruiguo Yu

  4. Foreign Language, Literature and Culture Studies Center, Tianjin Foreign Studies University, Tianjin, China

    Hongwei Liu

Authors
  1. Mei Yu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jiujiang Guo
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Jian Yu
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Tianyi Xu
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Mankun Zhao
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Hongwei Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  7. Xuewei Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  8. Ruiguo Yu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Xuewei Li.

Additional information

Publisher’s note

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

Rights and permissions

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. TBDRI: block decomposition based on relational interaction for temporal knowledge graph completion. Appl Intell 53, 5072–5084 (2023). https://doi.org/10.1007/s10489-022-03601-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-022-03601-5

Keywords