{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T07:09:44Z","timestamp":1783926584789,"version":"3.55.0"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004835","name":"Zhejiang University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004835","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018978","name":"Zhejiang Federation of Humanities and Social Sciences","doi-asserted-by":"publisher","award":["24NDJC113YB"],"award-info":[{"award-number":["24NDJC113YB"]}],"id":[{"id":"10.13039\/100018978","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018978","name":"Zhejiang Federation of Humanities and Social Sciences","doi-asserted-by":"publisher","award":["26NDJC058YB"],"award-info":[{"award-number":["26NDJC058YB"]}],"id":[{"id":"10.13039\/100018978","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.is.2026.102775","type":"journal-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T15:34:30Z","timestamp":1783524870000},"page":"102775","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Tensor decomposition with semantic adjustment and contrastive learning for temporal knowledge graph completion"],"prefix":"10.1016","volume":"142","author":[{"given":"Qun","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ken","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yusheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/j.is.2026.102775_b1","doi-asserted-by":"crossref","first-page":"13071","DOI":"10.1007\/s10462-023-10465-9","article-title":"Knowledge graphs: Opportunities and challenges","volume":"56","author":"Peng","year":"2023","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.is.2026.102775_b2","doi-asserted-by":"crossref","unstructured":"Z. Xu, M.J. Cruz, M. Guevara, T. Wang, M. Deshpande, X. Wang, Z. Li, Retrieval-augmented generation with knowledge graphs for customer service question answering, in: Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval, 2024, pp. 2905\u20132909.","DOI":"10.1145\/3626772.3661370"},{"issue":"4","key":"10.1016\/j.is.2026.102775_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103728","article-title":"A decision-support model through online reviews: Consumer preference analysis and product ranking","volume":"61","author":"Wu","year":"2024","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.is.2026.102775_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.dss.2025.114485","article-title":"Knowledge-based context-aware group recommender system for point of interest recommendation","volume":"196","author":"Pervin","year":"2025","journal-title":"Decis. Support Syst."},{"issue":"12","key":"10.1016\/j.is.2026.102775_b5","doi-asserted-by":"crossref","first-page":"9456","DOI":"10.1109\/TPAMI.2024.3417451","article-title":"A survey of knowledge graph reasoning on graph types: Static, dynamic, and multi-modal","volume":"46","author":"Liang","year":"2024","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.is.2026.102775_b6","article-title":"One model connects all graphs: Towards training one unified model for multi-domain graph pre-training using adaptive vector quantization","author":"Xie","year":"2025","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.is.2026.102775_b7","unstructured":"T. Trouillon, J. Welbl, S. Riedel, \u00c9. Gaussier, G. Bouchard, Complex embeddings for simple link prediction, in: International Conference on Machine Learning, 2016, pp. 2071\u20132080."},{"key":"10.1016\/j.is.2026.102775_b8","doi-asserted-by":"crossref","unstructured":"J. Leblay, M.W. Chekol, Deriving validity time in knowledge graph, in: Companion Proceedings of the the Web Conference, 2018, pp. 1771\u20131776.","DOI":"10.1145\/3184558.3191639"},{"key":"10.1016\/j.is.2026.102775_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121267","article-title":"Tensor decompositions for temporal knowledge graph completion with time perspective","volume":"237","author":"Yang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.is.2026.102775_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.109717","article-title":"Ftpcomplex: A flexible time perspective approach to temporal knowledge graph completion","volume":"139","author":"Nguyen","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.is.2026.102775_b11","doi-asserted-by":"crossref","unstructured":"E. Balkir, M. Naslidnyk, D. Palfrey, A. Mittal, Using pairwise occurrence information to improve knowledge graph completion on large-scale datasets, in: Proceedings of the Conference on Empirical Methods in Natural Language Processing and the International Joint Conference on Natural Language Processing, 2019, pp. 3591\u20133596.","DOI":"10.18653\/v1\/D19-1368"},{"key":"10.1016\/j.is.2026.102775_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119853","article-title":"Joint framework for tensor decomposition-based temporal knowledge graph completion","volume":"654","author":"Zhang","year":"2024","journal-title":"Inform. Sci."},{"key":"10.1016\/j.is.2026.102775_b13","series-title":"2021 Conference on Empirical Methods in Natural Language Processing, EMNLP 2021","first-page":"6894","article-title":"Simcse: Simple contrastive learning of sentence embeddings","author":"Gao","year":"2021"},{"issue":"2","key":"10.1016\/j.is.2026.102775_b14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3424672","article-title":"Knowledge graph embedding for link prediction: A comparative analysis","volume":"15","author":"Rossi","year":"2021","journal-title":"ACM Trans. Knowl. Discov. from Data (TKDD)"},{"key":"10.1016\/j.is.2026.102775_b15","unstructured":"M. Nickel, V. Tresp, H.-P. Kriegel, A three-way model for collective learning on multi-relational data, in: Proceedings of the International Conference on Machine Learning, 2011, pp. 809\u2013816."},{"key":"10.1016\/j.is.2026.102775_b16","unstructured":"B. Yang, S.W. t. Yih, X. He, J. Gao, L. Deng, Embedding entities and relations for learning and inference in knowledge bases, in: Proceedings of the International Conference on Learning Representations, 2015, pp. 1\u201313."},{"key":"10.1016\/j.is.2026.102775_b17","first-page":"4289","article-title":"Simple embedding for link prediction in knowledge graphs","volume":"31","author":"Kazemi","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.is.2026.102775_b18","doi-asserted-by":"crossref","unstructured":"I. Bala\u017eevi\u0107, C. Allen, T.M. Hospedales, Tucker: Tensor factorization for knowledge graph completion, in: Proceedings of the Conference on Empirical Methods in Natural Language Processing and International Joint Conference on Natural Language Processing, 2019, pp. 5184\u20135193.","DOI":"10.18653\/v1\/D19-1522"},{"key":"10.1016\/j.is.2026.102775_b19","series-title":"European Conference on Artificial Intelligence","first-page":"817","article-title":"Btde: block term decomposition embedding for link prediction in knowledge graph","author":"Luo","year":"2020"},{"key":"10.1016\/j.is.2026.102775_b20","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","volume":"26","author":"Bordes","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.is.2026.102775_b21","doi-asserted-by":"crossref","unstructured":"Z. Wang, J. Zhang, J. Feng, Z. Chen, Knowledge graph embedding by translating on hyperplanes, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 28, 2014, pp. 1112\u20131119.","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"10.1016\/j.is.2026.102775_b22","unstructured":"Z. Sun, Z.-H. Deng, J.-Y. Nie, J. Tang, Rotate: Knowledge graph embedding by relational rotation in complex space, in: International Conference on Learning Representations, 2019, pp. 1\u201318."},{"key":"10.1016\/j.is.2026.102775_b23","doi-asserted-by":"crossref","unstructured":"C. Gao, C. Sun, L. Shan, L. Lin, M. Wang, Rotate3d: Representing relations as rotations in three-dimensional space for knowledge graph embedding, in: Proceedings of the ACM International Conference on Information & Knowledge Management, 2020, pp. 385\u2013394.","DOI":"10.1145\/3340531.3411889"},{"key":"10.1016\/j.is.2026.102775_b24","doi-asserted-by":"crossref","unstructured":"M. Schlichtkrull, T.N. Kipf, P. Bloem, R. Van Den Berg, I. Titov, M. Welling, Modeling relational data with graph convolutional networks, in: European Semantic Web Conference, 2018, pp. 593\u2013607.","DOI":"10.1007\/978-3-319-93417-4_38"},{"issue":"5","key":"10.1016\/j.is.2026.102775_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2022.103004","article-title":"Gafm: A knowledge graph completion method based on graph attention faded mechanism","volume":"59","author":"Ma","year":"2022","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.is.2026.102775_b26","doi-asserted-by":"crossref","unstructured":"T. Dettmers, P. Minervini, P. Stenetorp, S. Riedel, Convolutional 2d knowledge graph embeddings, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 32, 2018, pp. 1811\u20131818.","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"10.1016\/j.is.2026.102775_b27","doi-asserted-by":"crossref","unstructured":"S. Vashishth, S. Sanyal, V. Nitin, N. Agrawal, P. Talukdar, Interacte: Improving convolution-based knowledge graph embeddings by increasing feature interactions, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34, 2020, pp. 3009\u20133016.","DOI":"10.1609\/aaai.v34i03.5694"},{"issue":"2","key":"10.1016\/j.is.2026.102775_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104460","article-title":"Text-free inductive knowledge graph embedding via meta graph-based prompt learning","volume":"63","author":"Yi","year":"2026","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.is.2026.102775_b29","unstructured":"T. Lacroix, G. Obozinski, N. Usunier, Tensor decompositions for temporal knowledge base completion, in: International Conference on Learning Representations, 2020, pp. 1\u201312."},{"key":"10.1016\/j.is.2026.102775_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107841","article-title":"Tucker decomposition-based temporal knowledge graph completion","volume":"238","author":"Shao","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.is.2026.102775_b31","doi-asserted-by":"crossref","unstructured":"I. Dikeoulias, S. Amin, G. Neumann, Temporal knowledge graph reasoning with low-rank and model-agnostic representations, in: Proceedings of the Workshop on Representation Learning for NLP, 2022, pp. 111\u2013120.","DOI":"10.18653\/v1\/2022.repl4nlp-1.12"},{"key":"10.1016\/j.is.2026.102775_b32","series-title":"Findings of the Association for Computational Linguistics","first-page":"7286","article-title":"Tucker decomposition with frequency attention for temporal knowledge graph completion","author":"Xiao","year":"2023"},{"key":"10.1016\/j.is.2026.102775_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2024.102249","article-title":"Mvtucker: Multi-view knowledge graphs representation learning based on tensor tucker model","volume":"106","author":"Wang","year":"2024","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.is.2026.102775_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.127953","article-title":"Two-layer tensor decomposition for temporal kge graph completion","volume":"287","author":"Yue","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.is.2026.102775_b35","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117036","article-title":"Block term decomposition with distinct time granularities for temporal knowledge graph completion","volume":"201","author":"Lai","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.is.2026.102775_b36","doi-asserted-by":"crossref","unstructured":"L. Yue, Y. Ren, Y. Zeng, J. Zhang, K. Zeng, J. Wan, Block decomposition with multi-granularity embedding for temporal knowledge graph completion, in: International Conference on Database Systems for Advanced Applications, 2023, pp. 706\u2013715.","DOI":"10.1007\/978-3-031-30672-3_47"},{"issue":"5","key":"10.1016\/j.is.2026.102775_b37","first-page":"5072","article-title":"Tbdri: block decomposition based on relational interaction for temporal knowledge graph completion","volume":"53","author":"Yu","year":"2023","journal-title":"Appl. Intell."},{"key":"10.1016\/j.is.2026.102775_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.111591","article-title":"Complex expressional characterizations learning based on block decomposition for temporal knowledge graph completion","volume":"290","author":"Yue","year":"2024","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.is.2026.102775_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119225","article-title":"T-gae: A timespan-aware graph attention-based embedding model for temporal knowledge graph completion","volume":"642","author":"Hou","year":"2023","journal-title":"Inform. Sci."},{"key":"10.1016\/j.is.2026.102775_b40","series-title":"Findings of the Association for Computational Linguistics","first-page":"7790","article-title":"Pre-trained language model with prompts for temporal knowledge graph completion","author":"Xu","year":"2023"},{"key":"10.1016\/j.is.2026.102775_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2024.127680","article-title":"Convtkg: A query-aware convolutional neural network-based embedding model for temporal knowledge graph completion","volume":"588","author":"He","year":"2024","journal-title":"Neurocomputing"},{"key":"10.1016\/j.is.2026.102775_b42","doi-asserted-by":"crossref","unstructured":"J. Li, X. Su, G. Gao, Teast: Temporal knowledge graph embedding via archimedean spiral timeline, in: Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2023, pp. 15460\u201315474.","DOI":"10.18653\/v1\/2023.acl-long.862"},{"key":"10.1016\/j.is.2026.102775_b43","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112268","article-title":"Tels: Learning time-evolving information and latent semantics using dual quaternion for temporal knowledge graph completion","volume":"301","author":"Guo","year":"2024","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"10.1016\/j.is.2026.102775_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2023.103605","article-title":"Multi-hop path reasoning over sparse temporal knowledge graphs based on path completion and reward shaping","volume":"61","author":"Meng","year":"2024","journal-title":"Inf. Process. Manage."},{"issue":"8","key":"10.1016\/j.is.2026.102775_b45","doi-asserted-by":"crossref","first-page":"3556","DOI":"10.1109\/TCYB.2019.2936042","article-title":"Hyperspectral image restoration using weighted group sparsity-regularized low-rank tensor decomposition","volume":"50","author":"Chen","year":"2019","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.is.2026.102775_b46","doi-asserted-by":"crossref","unstructured":"H. Ben-Younes, R. Cadene, N. Thome, M. Cord, Block: Bilinear superdiagonal fusion for visual question answering and visual relationship detection, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33, 2019, pp. 8102\u20138109.","DOI":"10.1609\/aaai.v33i01.33018102"},{"issue":"9","key":"10.1016\/j.is.2026.102775_b47","doi-asserted-by":"crossref","first-page":"6325","DOI":"10.1109\/TCOMM.2022.3187780","article-title":"Tensor decomposition-based channel estimation for hybrid mmwave massive mimo in high-mobility scenarios","volume":"70","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Commun."},{"issue":"1\u20134","key":"10.1016\/j.is.2026.102775_b48","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1002\/sapm192761164","article-title":"The expression of a tensor or a polyadic as a sum of products","volume":"6","author":"Hitchcock","year":"1927","journal-title":"J. Math. Phys."},{"key":"10.1016\/j.is.2026.102775_b49","first-page":"110","article-title":"The extension of factor analysis to three-dimensional matrices","volume":"110119","author":"Tucker","year":"1964","journal-title":"Contrib. Math. Psychol."},{"issue":"3","key":"10.1016\/j.is.2026.102775_b50","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1137\/070690729","article-title":"Decompositions of a higher-order tensor in block terms\u2014part ii: Definitions and uniqueness","volume":"30","author":"Lathauwer","year":"2008","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.is.2026.102775_b51","unstructured":"T. Lacroix, N. Usunier, G. Obozinski, Canonical tensor decomposition for knowledge base completion, in: International Conference on Machine Learning, 2018, pp. 2863\u20132872."},{"issue":"595","key":"10.1016\/j.is.2026.102775_b52","first-page":"28","volume":"3","author":"Lautenschlager","year":"2015","journal-title":"Harv. Dataverse"},{"key":"10.1016\/j.is.2026.102775_b53","doi-asserted-by":"crossref","unstructured":"A. Garcia-Duran, S. Duman\u010di\u0107, M. Niepert, Learning sequence encoders for temporal knowledge graph completion, in: Proceedings of the Conference on Empirical Methods in Natural Language Processing, 2018, pp. 4816\u20134821.","DOI":"10.18653\/v1\/D18-1516"},{"key":"10.1016\/j.is.2026.102775_b54","unstructured":"R. Trivedi, H. Dai, Y. Wang, L. Song, Know-evolve: Deep temporal reasoning for dynamic knowledge graphs, in: International Conference on Machine Learning, 2017, pp. 3462\u20133471."},{"key":"10.1016\/j.is.2026.102775_b55","series-title":"ISA Annual Convention","first-page":"1","article-title":"Gdelt: Global data on events, location, and tone","volume":"vol. 2","author":"Leetaru","year":"2013"},{"issue":"1","key":"10.1016\/j.is.2026.102775_b56","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/JPROC.2015.2483592","article-title":"A review of relational machine learning for knowledge graphs","volume":"104","author":"Nickel","year":"2015","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.is.2026.102775_b57","doi-asserted-by":"crossref","unstructured":"Z. Han, Z. Ding, Y. Ma, Y. Gu, V. Tresp, Learning neural ordinary equations for forecasting future links on temporal knowledge graphs, in: Proceedings of the Conference on Empirical Methods in Natural Language Processing, 2021, pp. 8352\u20138364.","DOI":"10.18653\/v1\/2021.emnlp-main.658"},{"key":"10.1016\/j.is.2026.102775_b58","doi-asserted-by":"crossref","unstructured":"R. Ying, M. Hu, J. Wu, Y. Xie, X. Liu, Z. Wang, M. Jiang, H. Gao, L. Zhang, R. Cheng, Simple but effective compound geometric operations for temporal knowledge graph completion, in: Proceedings of the Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2024, pp. 11074\u201311086.","DOI":"10.18653\/v1\/2024.acl-long.596"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030643792600089X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030643792600089X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T06:38:49Z","timestamp":1783924729000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030643792600089X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":58,"alternative-id":["S030643792600089X"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2026.102775","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tensor decomposition with semantic adjustment and contrastive learning for temporal knowledge graph completion","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2026.102775","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102775"}}