{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:43:47Z","timestamp":1787017427358,"version":"build-2736575974"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62273219"],"award-info":[{"award-number":["62273219"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002797","name":"Universities of Inner Mongolia Autonomous Region","doi-asserted-by":"crossref","award":["NMGIRT2317"],"award-info":[{"award-number":["NMGIRT2317"]}],"id":[{"id":"10.13039\/501100002797","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2026,2,28]]},"abstract":"<jats:p>\n                    In the realm of real-world knowledge graphs, the dynamism of facts is a prevailing characteristic. To illustrate, a popular restaurant was awarded a Michelin star in 2004 and retained this prestigious recognition in 2008, but lost it in 2012 due to changes in management and menu quality. This sequence highlights how neglecting temporal context can lead to misconceptions about factual accuracy. Furthermore, the relations intertwining distinct entities or the same entity across different chronological markers exhibit complexity and hierarchy. Regrettably, existing methods for temporal knowledge graph relation prediction fall short in following challenges: they lack a nuanced, hierarchical comprehension of knowledge structure and fail to adeptly integrate temporal dynamics with static attributes. Addressing these issues, this study introduces Hyperbolic-based Temporal Knowledge Graph Relation Prediction (HTKGP) approach to harness the power of hyperbolic geometry. Our innovation is an attention-guided, learnable curvature mechanism designed to preserve and enrich the intricate semantic hierarchy inherent in data. Besides, we propose a longitudinal information entity embedding strategy due to the plentiful temporal information. This not only captures the enduring impact of past events on present states but also achieves efficiency through parameter reduction. Empirical validation across multiple datasets shows HTKGP efficiently navigates the rich semantic landscape within hyperbolic spaces and yields superior predictive performance. Our implementations are publicly available at:\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/jianruichen\/HTKGP\">https:\/\/github.com\/jianruichen\/HTKGP<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1145\/3786587","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T11:23:22Z","timestamp":1767612202000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Hyperbolic-based Feature Learning for Temporal Knowledge Graph Relation Prediction"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9104-4540","authenticated-orcid":false,"given":"Jianrui","family":"Chen","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence and Computer Science, and Key Laboratory of Modern Teaching Technology, Ministry of Education, Shaanxi Normal University, Xi\u2019an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7665-6386","authenticated-orcid":false,"given":"Peijie","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence and Computer Science, Shaanxi Normal University, Xi\u2019an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0415-8556","authenticated-orcid":false,"given":"Maoguo","family":"Gong","sequence":"additional","affiliation":[{"name":"College of Mathematics Science, Inner Mongolia Normal University, Hohhot, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4375-9247","authenticated-orcid":false,"given":"Xuehui","family":"Zhao","sequence":"additional","affiliation":[{"name":"College of Mathematics Science, Inner Mongolia Normal University, Hohhot, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,2,4]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"9649","volume-title":"Advances in Neural Information Processing Systems","author":"Abboud Ralph","year":"2020","unstructured":"Ralph Abboud, Ismail Ceylan, Thomas Lukasiewicz, and Tommaso Salvatori. 2020. BoxE: A box embedding model for knowledge base completion. Advances in Neural Information Processing Systems 33 (2020), 9649\u20139661."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i10.21286"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"106308","DOI":"10.1016\/j.engappai.2023.106308","article-title":"RoAN: A relation-oriented attention network for temporal knowledge graph completion","volume":"123","author":"Bai Luyi","year":"2023","unstructured":"Luyi Bai, Xiangnan Ma, Xiangxi Meng, Xin Ren, and Yujing Ke. 2023. RoAN: A relation-oriented attention network for temporal knowledge graph completion. Engineering Applications of Artificial Intelligence 123 (2023), 106308.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"e_1_3_2_5_2","first-page":"1","article-title":"Multi-relational Poincar\u00e9 graph embeddings","volume":"32","author":"Balazevic Ivana","year":"2019","unstructured":"Ivana Balazevic, Carl Allen, and Timothy Hospedales. 2019. Multi-relational Poincar\u00e9 graph embeddings. Advances in Neural Information Processing Systems 32 (2019), 1\u201311.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"e_1_3_2_7_2","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","volume":"26","author":"Bordes Antoine","year":"2013","unstructured":"Antoine Bordes, Nicolas Usunier, Alberto Garcia-Duran, Jason Weston, and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. Advances in Neural Information Processing Systems 26 (2013), 2787\u20132795.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Ines Chami Adva Wolf Da-Cheng Juan Frederic Sala Sujith Ravi and Christopher R\u00e9. 2020. Low-dimensional hyperbolic knowledge graph embeddings. arXiv:2005.00545. Retrieved from https:\/\/arxiv.org\/abs\/2005.00545","DOI":"10.18653\/v1\/2020.acl-main.617"},{"key":"e_1_3_2_9_2","volume-title":"Hyperbolic Graph Convolutional Neural Networks","author":"Chami Ines","year":"2019","unstructured":"Ines Chami, Rex Ying, Christopher Re, and Jure Leskovec. 2019. Hyperbolic Graph Convolutional Neural Networks. Curran Associates Inc., Red Hook, NY."},{"key":"e_1_3_2_10_2","unstructured":"Linlin Chao Jianshan He Taifeng Wang and Wei Chu. 2020. Pairre: Knowledge graph embeddings via paired relation vectors. arXiv:2011.03798. Retrieved from https:\/\/arxiv.org\/abs\/2011.03798"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00022"},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.18653\/v1\/D18-1225","volume-title":"Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing (EMNL P \u201918)","author":"Dasgupta Shib Sankar","year":"2018","unstructured":"Shib Sankar Dasgupta, Swayambhu Nath Ray, and Partha P. Talukdar. 2018. HyTE: Hyperplane-based temporally aware knowledge graph embedding. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing (EMNL P \u201918), 2001\u20132011."},{"key":"e_1_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Zifeng Ding Yunpu Ma Bailan He and Volker Tresp. 2021. A Simple But Powerful Graph Encoder for Temporal Knowledge Graph Completion. In Intelligent Systems Conference 729\u2013747.","DOI":"10.1007\/978-3-031-47715-7_49"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1516"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5815"},{"key":"e_1_3_2_16_2","first-page":"1","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Han Zhen","year":"2020","unstructured":"Zhen Han, Peng Chen, Yunpu Ma, and Volker Tresp. 2020. Explainable subgraph reasoning for forecasting on temporal knowledge graphs. In Proceedings of the International Conference on Learning Representations, 1\u201312."},{"key":"e_1_3_2_17_2","unstructured":"Zhen Han Zifeng Ding Yunpu Ma Yujia Gu and Volker Tresp. 2021. Temporal knowledge graph forecasting with neural ode. arXiv:2101.05151. Retrieved from https:\/\/arxiv.org\/abs\/2101.05151"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Zhen Han Yunpu Ma Peng Chen and Volker Tresp. 2020. Dyernie: Dynamic evolution of Riemannian manifold embeddings for temporal knowledge graph completion. arXiv:2011.03984. Retrieved from https:\/\/arxiv.org\/abs\/2011.03984","DOI":"10.18653\/v1\/2020.emnlp-main.593"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1021\/ci0342472"},{"key":"e_1_3_2_20_2","first-page":"1715","volume-title":"Proceedings of the 26th International Conference on Computational Linguistics: Technical Papers (COLING \u201916)","author":"Jiang Tingsong","year":"2016","unstructured":"Tingsong Jiang, Tianyu Liu, Tao Ge, Lei Sha, Baobao Chang, Sujian Li, and Zhifang Sui. 2016. Towards time-aware knowledge graph completion. In Proceedings of the 26th International Conference on Computational Linguistics: Technical Papers (COLING \u201916), 1715\u20131724."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467292"},{"issue":"31","key":"e_1_3_2_22_2","first-page":"3988","article-title":"Simple embedding for link prediction in knowledge graphs","volume":"31","author":"Kazemi Seyed Mehran","year":"2018","unstructured":"Seyed Mehran Kazemi and David Poole. 2018. Simple embedding for link prediction in knowledge graphs. Advances in Neural Information Processing Systems 31, 31 (2018), 3988\u20133995.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_23_2","unstructured":"Diederik P. Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv:1412.6980. Retrieved from https:\/\/arxiv.org\/abs\/1412.6980"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106"},{"key":"e_1_3_2_25_2","first-page":"1","article-title":"Imagenet classification with deep convolutional neural networks","volume":"25","author":"Krizhevsky Alex","year":"2012","unstructured":"Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton. 2012. Imagenet classification with deep convolutional neural networks. Advances in Neural Information Processing Systems 25 (2012), 1\u20139.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_26_2","unstructured":"Timoth\u00e9e Lacroix Guillaume Obozinski and Nicolas Usunier. 2020. Tensor decompositions for temporal knowledge base completion. arXiv:2004.04926. Retrieved from https:\/\/arxiv.org\/abs\/2004.04926"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117036"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191639"},{"key":"e_1_3_2_29_2","first-page":"1","volume-title":"ISA Annual Convention","author":"Leetaru Kalev","year":"2013","unstructured":"Kalev Leetaru and Philip A. Schrodt. 2013. Gdelt: Global data on events, location, and tone, 1979\u20132012. In ISA Annual Convention, Vol. 2, Citeseer, 1\u201349."},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.3233\/SW-140134"},{"key":"e_1_3_2_31_2","first-page":"2034","volume-title":"Advances in Neural Information Processing Systems","author":"Liu Shuwen","year":"2021","unstructured":"Shuwen Liu, Bernardo Grau, Ian Horrocks, and Egor Kostylev. 2021. INDIGO: GNN-based inductive knowledge graph completion using pair-wise encoding. In Advances in Neural Information Processing Systems 34 (2021), 2034\u20132045."},{"key":"e_1_3_2_32_2","first-page":"1","volume-title":"Proceedings of the 7th Biennial Conference on Innovative Data Systems Research","author":"Mahdisoltani Farzaneh","year":"2014","unstructured":"Farzaneh Mahdisoltani, Joanna Biega, and Fabian Suchanek. 2014. Yago3: A knowledge base from multilingual Wikipedias. In Proceedings of the 7th Biennial Conference on Innovative Data Systems Research, 1\u201311."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20746"},{"key":"e_1_3_2_34_2","first-page":"1","volume-title":"Advances in Neural Information Processing Systems","author":"Nickel Maximillian","year":"2017","unstructured":"Maximillian Nickel and Douwe Kiela. 2017. Poincar\u00e9 embeddings for learning hierarchical representations. In Advances in Neural Information Processing Systems, 1\u201310."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482421"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056373"},{"key":"e_1_3_2_37_2","first-page":"845","article-title":"Tree! I am no tree! I am a low dimensional hyperbolic embedding","volume":"33","author":"Sonthalia Rishi","year":"2020","unstructured":"Rishi Sonthalia and Anna Gilbert. 2020. Tree! I am no tree! I am a low dimensional hyperbolic embedding. Advances in Neural Information Processing Systems 33 (2020), 845\u2013856.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-0360-y"},{"key":"e_1_3_2_40_2","doi-asserted-by":"crossref","unstructured":"Zequn Sun Muhao Chen Wei Hu Chengming Wang Jian Dai and Wei Zhang. 2020. Knowledge association with hyperbolic knowledge graph embeddings. arXiv:2010.02162. Retrieved from https:\/\/arxiv.org\/abs\/2010.02162","DOI":"10.18653\/v1\/2020.emnlp-main.460"},{"key":"e_1_3_2_41_2","unstructured":"Zhiqing Sun Zhi-Hong Deng Jian-Yun Nie and Jian Tang. 2019. Rotate: Knowledge graph embedding by relational rotation in complex space. arXiv:1902.10197. Retrieved from https:\/\/arxiv.org\/abs\/1902.10197"},{"key":"e_1_3_2_42_2","unstructured":"Alexandru Tifrea Gary B\u00e9cigneul and Octavian-Eugen Ganea. 2018. Poincar\u00e9 glove: Hyperbolic word embeddings. arXiv:1810.06546. Retrieved from https:\/\/arxiv.org\/abs\/1810.06546"},{"key":"e_1_3_2_43_2","first-page":"2071","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Trouillon Th\u00e9o","year":"2016","unstructured":"Th\u00e9o Trouillon, Johannes Welbl, Sebastian Riedel, \u00c9ric Gaussier, and Guillaume Bouchard. 2016. Complex embeddings for simple link prediction. In Proceedings of the International Conference on Machine Learning. PMLR, 2071\u20132080."},{"issue":"1","key":"e_1_3_2_44_2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0898-1221(01)85012-4","article-title":"Hyperbolic trigonometry and its application in the Poincar\u00e9 ball model of hyperbolic geometry","volume":"41","author":"Ungar Abraham A.","year":"2001","unstructured":"Abraham A. Ungar. 2001. Hyperbolic trigonometry and its application in the Poincar\u00e9 ball model of hyperbolic geometry. Computers and Mathematics with Applications 41, 1\u20132 (2001), 135\u2013147.","journal-title":"Computers and Mathematics with Applications"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-020-09838-1"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/2629489"},{"key":"e_1_3_2_47_2","doi-asserted-by":"crossref","unstructured":"Zhen Wang Haotong Du Quanming Yao and Xuelong Li. 2022. Search to Pass Messages for Temporal Knowledge Graph Completion. arXiv:2210.16740. Retrieved from https:\/\/arxiv.org\/pdf\/2210.16740","DOI":"10.18653\/v1\/2022.findings-emnlp.458"},{"key":"e_1_3_2_48_2","doi-asserted-by":"crossref","first-page":"1901","DOI":"10.1007\/978-981-15-5959-4_231","volume-title":"Innovative Computing","author":"Wang Zhanquan","year":"2020","unstructured":"Zhanquan Wang, Mengyuan Guo, Zhen Li, Minwei Tang, and Jiechao Yu. 2020. Knowledge graph construction for payment data risk control. In Innovative Computing. Chao-Tung Yang, Yan Pei, and Jia-Wei Chang (Eds.), Springer Singapore, Singapore, 1901\u20131907."},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"e_1_3_2_50_2","first-page":"5730","volume-title":"Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing","author":"Wu Jiapeng","year":"2020","unstructured":"Jiapeng Wu, Meng Cao, Jackie Chi Kit Cheung, and William L. Hamilton. 2020. Temp: Temporal message passing for temporal knowledge graph completion. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 5730\u20135746."},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.202"},{"key":"e_1_3_2_52_2","first-page":"654","volume-title":"Proceedings of the Semantic Web (ISWC \u201920)","author":"Xu Chenjin","year":"2020","unstructured":"Chenjin Xu, Mojtaba Nayyeri, Fouad Alkhoury, Hamed Yazdi, and Jens Lehmann. 2020. Temporal knowledge graph completion based on time series Gaussian embedding. In Proceedings of the Semantic Web (ISWC \u201920). Springer International Publishing, Cham, 654\u2013671."},{"key":"e_1_3_2_53_2","first-page":"1583","volume-title":"Proceedings of the International Conference on Computational Linguistics","author":"Xu Chengjin","year":"2020","unstructured":"Chengjin Xu, Mojtaba Nayyeri, Fouad Alkhoury, Hamed Shariat Yazdi, and Jens Lehmann. 2020. TeRo: A time-aware knowledge graph embedding via temporal rotation. In Proceedings of the International Conference on Computational Linguistics, 1583\u20131593."},{"key":"e_1_3_2_54_2","first-page":"153","volume-title":"Proceedings of the International Conference on Database Systems for Advanced Applications","author":"Yan Cheng","year":"2022","unstructured":"Cheng Yan, Feng Zhao, and Hai Jin. 2022. ExKGR: Explainable multi-hop reasoning for evolving knowledge graph. In Proceedings of the International Conference on Database Systems for Advanced Applications, 153\u2013161."},{"key":"e_1_3_2_55_2","unstructured":"Bishan Yang Wen-Tau Yih Xiaodong He Jianfeng Gao and Li Deng. 2014. Embedding entities and relations for learning and inference in knowledge bases. arXiv:1412.6575. Retrieved from https:\/\/arxiv.org\/abs\/1412.6575"},{"key":"e_1_3_2_56_2","unstructured":"Menglin Yang Min Zhou Zhihao Li Jiahong Liu Lujia Pan Hui Xiong and Irwin King. 2022. Hyperbolic graph neural networks: A review of methods and applications. arXiv:2202.13852. Retrieved from https:\/\/arxiv.org\/abs\/2202.13852"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110078"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3786587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T12:45:25Z","timestamp":1770209125000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3786587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,4]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2,28]]}},"alternative-id":["10.1145\/3786587"],"URL":"https:\/\/doi.org\/10.1145\/3786587","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,4]]},"assertion":[{"value":"2023-10-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}