Abstract
The extrapolation task in the temporal knowledge graph has received increasing attention from scholars due to its wide range of practical application scenarios. At present, recurrent neural networks are currently widely used in temporal knowledge graph completion techniques. These networks are employed to depict the sequential pattern of entities and relations. However, as the sequence lengthens, some critical early information may become diluted. Prediction errors ensue in the completion task as a result. Furthermore, it is observed that existing temporal knowledge graph completion methods fail to account for the topological structure of relations, which leads to relation representations with essentially little distinction across different timestamps. In order to tackle the previously mentioned concern, our research introduces a Temporal Knowledge Graph Completion Method utilizing Sequence-Focus Patterns Representation Learning (SFP). This method contains two patterns: the Focus pattern and the Sequential pattern. In the SFP model, we developed a novel graph attention network called ConvGAT. This network efficiently distinguishes and extracts complex relation information, thereby enhancing the accuracy of entity representations that are aggregated in the Focus pattern and Sequential pattern. Furthermore we proposed RelGAT, a graph attention network that simulates the topological structure of relations. This enhances the precision of relation representations and facilitates the differentiation between relation embeddings generated at various timestamps in the Focus pattern. Utilizing a time-aware attention mechanism, the Focus pattern extracts vital information at particular timestamps in order to amplify the data that the Sequential pattern dilutes. On five distinct benchmark datasets, SFP significantly outperforms the baseline, according to a comprehensive series of experiments.










Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Data Availability
This model’s codes and data are available at https://github.com/muke2000/SFP.
References
Guo Q, Zhuang F, Qin C, Zhu H, Xie X, Xiong H, He Q (2020) A survey on knowledge graph-based recommender systems. IEEE Trans Knowl Data Eng 34(8):3549–3568
Fu B, Qiu Y, Tang C, Li Y, Yu H, Sun J (2020) A survey on complex question answering over knowledge base: Recent advances and challenges. arXiv:2007.13069
Ji S, Pan S, Cambria E, Marttinen P, Philip SY (2021) A survey on knowledge graphs: Representation, acquisition, and applications. IEEE Trans Neural Netw Learn Syst 33(2):494–514
Leblay J, Chekol MW (2018) Deriving validity time in knowledge graph. In: Companion proceedings of the the web conference, vol 2018, pp 1771–1776
Dasgupta SS, Ray SN, Talukdar P (2018) Hyte: Hyperplane-based temporally aware knowledge graph embedding. In: Proceedings of the 2018 conference on empirical methods in natural language processing, pp 2001–2011
García-Durán A, Dumančić S, Niepert M (2018) Learning sequence encoders for temporal knowledge graph completion. arXiv:1809.03202
Han Z, Chen P, Ma Y, Tresp V (2020) xerte: Explainable reasoning on temporal knowledge graphs for forecasting future links. arXiv:2012.15537
Liu Y, Ma Y, Hildebrandt M, Joblin M, Tresp V (2022) Tlogic: Temporal logical rules for explainable link forecasting on temporal knowledge graphs. In: Proceedings of the AAAI conference on artificial intelligence, vol 36, pp 4120–4127
Jin W, Qu M, Jin X, Ren X (2019) Recurrent event network: Autoregressive structure inference over temporal knowledge graphs. arXiv:1904.05530
Li Z, Jin X, Li W, Guan S, Guo J, Shen H, Wang Y, Cheng X (2021) Temporal knowledge graph reasoning based on evolutional representation learning. In: Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval, pp 408–417
Li Y, Sun S, Zhao J (2022) Tirgn: time-guided recurrent graph network with local-global historical patterns for temporal knowledge graph reasoning. In: Proceedings of the thirty-first international joint conference on artificial intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022, ijcai. org, pp 2152–2158
Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. Advances in Neural Information Processing Systems 26
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 (volume 1: Long papers), pp 687–696
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
Nickel M, Tresp V, Kriegel H-P et al (2011) A three-way model for collective learning on multi-relational data. Icml 11:3104482–3104584
Yang B, Yih W-t, He X, Gao J, Deng L (2014) Embedding entities and relations for learning and inference in knowledge bases. arXiv:1412.6575
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
Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv:1609.02907
Veličković P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv:1710.10903
Schlichtkrull M, Kipf TN, Bloem P, Van Den Berg R, Titov I, Welling M (2018) Modeling relational data with graph convolutional networks. In: The Semantic Web: 15th International Conference, ESWC 2018, Heraklion, Crete, Greece, June 3–7, 2018, Proceedings 15, Springer, pp. 593–607
Vashishth S, Sanyal S, Nitin V, Talukdar P (2019) Composition-based multi-relational graph convolutional networks. arXiv:1911.03082
Goel R, Kazemi SM, 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
Sadeghian A, Armandpour M, Colas A, Wang DZ (2021) Chronor: Rotation based temporal knowledge graph embedding. In: Proceedings of the AAAI conference on artificial intelligence, vol 35, pp 6471–6479
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
Park N, Liu F, Mehta P, Cristofor D, Faloutsos C, Dong Y (2022) Evokg: Jointly modeling event time and network structure for reasoning over temporal knowledge graphs. In: Proceedings of the fifteenth ACM international conference on web search and data mining, pp 794–803
Shang C, Tang Y, Huang J, Bi J, He X, Zhou B (2019) End-to-end structure-aware convolutional networks for knowledge base completion. In: Proceedings of the AAAI conference on artificial intelligence, vol 33, pp 3060–3067
Boschee E, Lautenschlager J, O’Brien S, Shellman S, Starz J, Ward M (2015). ICEWS Coded Event Data. https://doi.org/10.7910/DVN/28075
Erxleben F, Günther M, Krötzsch M, Mendez J, Vrandečić D (2014) Introducing wikidata to the linked data web. In: The Semantic Web–ISWC 2014: 13th international semantic web conference, Riva del Garda, Italy, October 19-23, 2014. Proceedings, Part I 13. Springer, pp 50–65
Mahdisoltani F, Biega J, Suchanek FM (2013) Yago3: A knowledge base from multilingual wikipedias. In: CIDR
Sun H, Zhong J, Ma Y, Han Z, He K (2021) Timetraveler: Reinforcement learning for temporal knowledge graph forecasting. arXiv:2109.04101
Li Z, Guan S, Jin X, Peng W, Lyu Y, Zhu Y, Bai L, Li W, Guo J, Cheng X (2022) Complex evolutional pattern learning for temporal knowledge graph reasoning. arXiv:2203.07782
Lin Q, Liu J, Mao R, Xu F, Cambria E (2023) Techs: Temporal logical graph networks for explainable extrapolation reasoning. In: Proceedings of the 61st annual meeting of the association for computational linguistics (Volume 1: Long Papers), pp 1281–1293
Liang K, Meng L, Liu M, Liu Y, Tu W, Wang S, Zhou S, Liu X (2023) Learn from relational correlations and periodic events for temporal knowledge graph reasoning. In: Proceedings of the 46th international ACM SIGIR conference on research and development in information retrieval, pp 1559–1568
Van der Maaten L, Hinton G, (2008) Visualizing data using t-sne. Journal of Machine Learning Research 9(11)
Funding
This work was supported by the Natural Science Foundation of Fujian, China(No. 2021J01619), and the National Natural Science Foundation of China(No.61672159).
Author information
Authors and Affiliations
Contributions
All authors contributed to this paper. The design and implementation of the model algorithm was mainly completed by JingBin Wang. The first draft of the manuscript and part of the algorithm design were completed by XiFan Ke. Kun Guo participated in the discussion, proposed the model and completed the review and editing of the manuscript. Material preparation, data collection and analysis were performed by FuYuan Zhang, YuWei Wu, SiRui Zhang. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing Interests
The authors declare that there is no conflict of interest regarding the publication of this paper.
Additional information
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.
About this article
Cite this article
Wang, J., Ke, X., Zhang, F. et al. SFP: temporal knowledge graph completion based on sequence-focus patterns representation learning. Appl Intell 55, 537 (2025). https://doi.org/10.1007/s10489-025-06306-7
Accepted:
Published:
DOI: https://doi.org/10.1007/s10489-025-06306-7