{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T05:11:52Z","timestamp":1741237912532,"version":"3.38.0"},"reference-count":37,"publisher":"National Library of Serbia","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:p>Temporal knowledge graph completion is a technique that uses existing knowledge to predict or infer the missing information in the temporal knowledge graph. It combines the technical features of knowledge graph completion and time series analysis to deal with entities and relationships that change over time. The existing temporal knowledge graph completion technology fails to make effective use of the special relationship between relations and time series information, and it is difficult to fully represent the complex relationships existing in the graph. In order to solve the above problems, the model based on time probability box embedding (TPBoxE) was proposed. Firstly, the entities and relationships in the temporal knowledge graph are represented in the vector space by box embedding, so as to complete the static part of the temporal knowledge graph. Secondly, the head and tail entities that exist at the same time in a given time period are selected, and the completed static parts are filtered according to the time information of the entities. Finally, the Bayesian classification method is used to fully mine the time features hidden in the relationship, and the completion results are obtained by combining the confidence scores of the static parts. The link prediction task test of the proposed model on YAGO11k, WIKIdata12k, ICEWS18 and GDELT datasets shows that the proposed model has better performance than the existing excellent models, which proves the effectiveness and advancement of TPBoxE.<\/jats:p>","DOI":"10.2298\/csis240820006l","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T08:54:23Z","timestamp":1737449663000},"page":"153-180","source":"Crossref","is-referenced-by-count":0,"title":["TPBoxE: Temporal knowledge graph completion based on time probability box embedding"],"prefix":"10.2298","volume":"22","author":[{"given":"Song","family":"Li","sequence":"first","affiliation":[{"name":"Harbin University of Science and Technology, Harbin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Wang","sequence":"additional","affiliation":[{"name":"Harbin University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Li","sequence":"additional","affiliation":[{"name":"Heilongjiang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liping","family":"Zhang","sequence":"additional","affiliation":[{"name":"Harbin University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","reference":[{"key":"ref1","unstructured":"Abboud, R.: BoxE: A Box Embedding Model for Knowledge Base Completion. Advances in Neural Information Processing Systems 33, 9649-9661 (2020)"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"Ahmed, I.A., AL-Aswadi, F.N., Noaman, K.M., Alma\u2019aitah, W.Z.: Arabic Knowledge Graph Construction: A close look in the present and into the future. Journal of King Saud University - Computer and Information Sciences 34(9), 6505-6523 (Oct 2022)","DOI":"10.1016\/j.jksuci.2022.04.007"},{"key":"ref3","unstructured":"Boratko, M., Chen, M., Dasgupta, S.S., Li, X.L., McCallum, A.: Probabilistic Box Embeddings for Uncertain Knowledge Graph Reasoning. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. pp. 882-893. Association for Computational Linguistics, Online (2021)"},{"key":"ref4","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating Embeddings for Modeling Multi-relational Data. Proceedings of the 26th International Conference on Neural Information Processing Systems pp. 2787-2795 (2013)"},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"Cai, B., Xiang, Y., Gao, L., Zhang, H., Li, Y., Li, J.: Temporal Knowledge Graph Completion: A Survey. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. pp. 6545-6553. International Joint Conferences on Artificial Intelligence Organization, Macau, SAR China (Aug 2023)","DOI":"10.24963\/ijcai.2023\/734"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"Cai, L., Janowicz, K., Yan, B., Zhu, R., Mai, G.: Time in a Box: Advancing Knowledge Graph Completion with Temporal Scopes. In: Proceedings of the 11th on Knowledge Capture Conference. pp. 121-128. ACM, Virtual Event USA (Dec 2021)","DOI":"10.1145\/3460210.3493566"},{"key":"ref7","doi-asserted-by":"crossref","unstructured":"Dasgupta, S.S., Ray, S.N., Talukdar, P.: HyTE: Hyperplane-based Temporally aware Knowledge Graph Embedding. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. pp. 2001-2011. Association for Computational Linguistics, Brussels, Belgium (2018)","DOI":"10.18653\/v1\/D18-1225"},{"key":"ref8","unstructured":"Dasgupta, S.S., Zhang, D., Li, X.L., Boratko, M., Vilnis, L., McCallum, A.: Improving Local Identifiability in Probabilistic Box Embeddings. advances in neural information processing systems pp. 182-192 (2020)"},{"key":"ref9","doi-asserted-by":"crossref","unstructured":"Dettmers, T., Minervini, P., Stenetorp, P., Riedel, S.: Convolutional 2D Knowledge Graph Embeddings. Proceedings of the AAAI Conference on Artificial Intelligence 32(1) (Apr 2018)","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"F\u00e4rber, M., Bartscherer, F., Menne, C., Rettinger, A.: Linked data quality of DBpedia, Freebase, OpenCyc, Wikidata, and YAGO. Semantic Web 9(1), 77-129 (Nov 2017)","DOI":"10.3233\/SW-170275"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"He, M., Zhu, L., Bai, L.: Convtkg: A query-aware convolutional neural networkbased embedding model for temporal knowledge graph completion. Neurocomputing 588, 127680 (2024), https:\/\/www.sciencedirect.com\/science\/article\/pii\/S092523122400451X","DOI":"10.1016\/j.neucom.2024.127680"},{"key":"ref12","unstructured":"He Peng, Gang, Z., Jing, C., Mengli, Z., Yuanlong, N.: Type-Enhanced Temporal Knowledge Graph Representation Learning Model. Journal of Computer Research and Development 60(4), 916-929 (2023)"},{"key":"ref13","doi-asserted-by":"crossref","unstructured":"Hoffart, J., Suchanek, F.M., Berberich, K., Weikum, G.: YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia. Artificial Intelligence 194, 28-61 (Jan 2013)","DOI":"10.1016\/j.artint.2012.06.001"},{"key":"ref14","doi-asserted-by":"crossref","unstructured":"Huang, J., Lu, T., Zhu, J., Yu, W., Zhang, T.: Multi-relational knowledge graph completion method with local information fusion. Applied Intelligence 52(7), 7985-7994 (May 2022)","DOI":"10.1007\/s10489-021-02876-4"},{"key":"ref15","doi-asserted-by":"crossref","unstructured":"Jain, P., Rathi, S., Mausam, Chakrabarti, S.: Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). pp. 3733-3747. Association for Computational Linguistics, Online (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.305"},{"key":"ref16","unstructured":"Lacroix, T., Obozinski, G., Usunier, N.: TENSOR DECOMPOSITIONS FOR TEMPORAL KNOWLEDGE BASE COMPLETION. International Conference on Learning Representations pp. 1-12 (2020)"},{"key":"ref17","doi-asserted-by":"crossref","unstructured":"Leblay, J., Chekol, M.W.: Deriving Validity Time in Knowledge Graph. In: Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW \u201918. pp. 1771-1776. ACM Press, Lyon, France (2018)","DOI":"10.1145\/3184558.3191639"},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"Liu,W., Zhou, P., Zhao, Z.,Wang, Z., Ju, Q., Deng, H.,Wang, P.: K-BERT: Enabling Language Representation with Knowledge Graph. Proceedings of the AAAI Conference on Artificial Intelligence 34(03), 2901-2908 (Apr 2020)","DOI":"10.1609\/aaai.v34i03.5681"},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"Liu, Y., Ma, Y., Hildebrandt, M., Joblin, M., Tresp, V.: TLogic: Temporal Logical Rules for Explainable Link Forecasting on Temporal Knowledge Graphs. Proceedings of the AAAI Conference on Artificial Intelligence 36(4), 4120-4127 (Jun 2022)","DOI":"10.1609\/aaai.v36i4.20330"},{"key":"ref20","doi-asserted-by":"crossref","unstructured":"Messner, J., Abboud, R., Ceylan, I.I.: Temporal Knowledge Graph Completion Using Box Embeddings. Proceedings of the AAAI Conference on Artificial Intelligence 36(7), 7779-7787 (Jun 2022)","DOI":"10.1609\/aaai.v36i7.20746"},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"Miao, L., Li, X., Yu, D., Ren, Y., Huang, Y., Cao, S.: Integrating users\u2019 long-term and shortterm interests with knowledge graph to improve restaurant recommendation. Journal of King Saud University - Computer and Information Sciences 35(9), 101735 (Oct 2023)","DOI":"10.1016\/j.jksuci.2023.101735"},{"key":"ref22","doi-asserted-by":"crossref","unstructured":"Paulheim, H.: Knowledge graph refinement: A survey of approaches and evaluation methods. Semantic Web 8(3), 489-508 (Dec 2016)","DOI":"10.3233\/SW-160218"},{"key":"ref23","doi-asserted-by":"crossref","unstructured":"Peng, C., Xia, F., Naseriparsa, M., Osborne, F.: Knowledge Graphs: Opportunities and Challenges. Artificial Intelligence Review 56(11), 13071-13102 (Nov 2023)","DOI":"10.1007\/s10462-023-10465-9"},{"key":"ref24","doi-asserted-by":"crossref","unstructured":"Rezatofighi, H., Tsoi, N., Gwak, J., Sadeghian, A., Reid, I., Savarese, S.: Generalized Intersection Over Union: A Metric and a Loss for Bounding Box Regression. In: 2019 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 658-666. IEEE, Long Beach, CA, USA (Jun 2019)","DOI":"10.1109\/CVPR.2019.00075"},{"key":"ref25","unstructured":"Song, L., Zhe,W., Liping, Z.: SL-tgStore: new temporal knowledge graph storage model. Journal of Zhejiang University (Engineering Science) 58(3), 449-458 (2024)"},{"key":"ref26","unstructured":"Sun, Z., Deng, Z.H., Nie, J.Y., Tang, J.: ROTATE: KNOWLEDGE GRAPH EMBEDDING BY RELATIONAL ROTATION IN COMPLEX SPACE. International Conference on Learning Representations pp. 1-18 (2019)"},{"key":"ref27","unstructured":"Trouillon, T.,Welbl, J., Riedel, S.: Complex Embeddings for Simple Link Prediction. The 33rd International Conference on Machine Learning 48, 2071-2080 (2016)"},{"key":"ref28","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, \u0141., Polosukhin, I.: Attention is All you Need. Advances in neural information processing systems 30, 11 (2017)"},{"key":"ref29","unstructured":"Veli\u010dkovic, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: GRAPH ATTENTION NETWORKS. stat 1050(20), 10-48550 (2018)"},{"key":"ref30","doi-asserted-by":"crossref","unstructured":"Vrande\u010di\u0107, D., Kr\u00f6tzsch, M.: Wikidata: A free collaborative knowledgebase. Communications of the ACM 57(10), 78-85 (Sep 2014)","DOI":"10.1145\/2629489"},{"key":"ref31","doi-asserted-by":"crossref","unstructured":"Wang, F., Gai, Y., Zhang, H.: Blockchain user digital identity big data and information security process protection based on network trust. Journal of King Saud University - Computer and Information Sciences 36(4), 102031 (Apr 2024)","DOI":"10.1016\/j.jksuci.2024.102031"},{"key":"ref32","doi-asserted-by":"crossref","unstructured":"Wang, H., Yang, J., Yang, L.T., Gao, Y., Ding, J., Zhou, X., Liu, H.: Mvtucker: Multi-view knowledge graphs representation learning based on tensor tucker model. Information Fusion 106, 102249 (2024), https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1566253524000277","DOI":"10.1016\/j.inffus.2024.102249"},{"key":"ref33","doi-asserted-by":"crossref","unstructured":"Wang, J., Wang, B., Gao, J., Pan, S., Liu, T., Yin, B., Gao, W.: Made: Multicurvature adaptive embedding for temporal knowledge graph completion. IEEE Transactions on Cybernetics pp. 1-14 (2024)","DOI":"10.1109\/TCYB.2024.3392957"},{"key":"ref34","doi-asserted-by":"crossref","unstructured":"Wang, L., Lu, J., Sun, Y.: Knowledge graph representation learning model based on metainformation and logical rule enhancements. Journal of King Saud University - Computer and Information Sciences 35(4), 112-125 (Apr 2023)","DOI":"10.1016\/j.jksuci.2023.03.008"},{"key":"ref35","unstructured":"Wenjun, Z., Liangxiao, J., Huan, Z., Long, C.: A Two-Layer Bayes Model: Random Forest Naive Bayes. Journal of Computer Research and Development 58(9), 2040-2051 (2021)"},{"key":"ref36","unstructured":"Yang, B., Yih, W.t., He, X., Gao, J., Deng, L.: EMBEDDING ENTITIES AND RELATIONS FOR LEARN- ING AND INFERENCE IN KNOWLEDGE BASES. International Conference on Learning Representations pp. 1-13 (2015)"},{"key":"ref37","doi-asserted-by":"crossref","unstructured":"Yue, L., Ren, Y., Zeng, Y., Zhang, J., Zeng, K., Wan, J., Zhou, M.: Complex expressional characterizations learning based on block decomposition for temporal knowledge graph completion. Knowledge-Based Systems 290, 111591 (2024), https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0950705124002260","DOI":"10.1016\/j.knosys.2024.111591"}],"container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T09:24:41Z","timestamp":1741166681000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02142500006L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.2298\/csis240820006l","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"type":"print","value":"1820-0214"},{"type":"electronic","value":"2406-1018"}],"subject":[],"published":{"date-parts":[[2025]]}}}