{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:08:21Z","timestamp":1774595301287,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"The Natural Science Foundation of Fujian, China","award":["No.2021J01619"],"award-info":[{"award-number":["No.2021J01619"]}]},{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No.61672159"],"award-info":[{"award-number":["No.61672159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10489-023-04481-z","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T22:02:26Z","timestamp":1677794546000},"page":"19285-19301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["GLANet: temporal knowledge graph completion based on global and local information-aware network"],"prefix":"10.1007","volume":"53","author":[{"given":"Jingbin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xinyu","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Xifan","family":"Ke","sequence":"additional","affiliation":[]},{"given":"Renfei","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Changkai","family":"You","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6270-2468","authenticated-orcid":false,"given":"Kun","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"key":"4481_CR1","doi-asserted-by":"crossref","unstructured":"Li M, Sun Z, Zhang W et al (2022) Leveraging semantic property for temporal knowledge graph completion. Appl Intell:1\u201314","DOI":"10.1007\/s10489-022-03981-8"},{"key":"4481_CR2","doi-asserted-by":"crossref","unstructured":"Leblay J, Chekol MW (2018) Deriving validity time in knowledge graph. In: Companion proceedings of the the web conference 2018, pp 1771\u20131776","DOI":"10.1145\/3184558.3191639"},{"key":"4481_CR3","unstructured":"Lacroix T, Obozinski G, Usunier N (2020) Tensor decompositions for temporal knowledge base completion. arXiv:200404926"},{"key":"4481_CR4","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Dur\u00e1n A, Duma\u0148ci\u0107 S, Niepert M (2018) Learning sequence encoders for temporal knowledge graph completion. arXiv:180903202","DOI":"10.18653\/v1\/D18-1516"},{"key":"4481_CR5","doi-asserted-by":"crossref","unstructured":"Zhu C, Chen M, Fan C et al (2021) Learning from history: modeling temporal knowledge graphs with sequential copy-generation networks. In: Proceedings of the AAAI conference on artificial intelligence, pp 4732\u20134740","DOI":"10.1609\/aaai.v35i5.16604"},{"key":"4481_CR6","doi-asserted-by":"crossref","unstructured":"Li Z, Guan S, Jin X et al (2022) Complex evolutional pattern learning for temporal knowledge graph reasoning. arXiv:220307782","DOI":"10.18653\/v1\/2022.acl-short.32"},{"key":"4481_CR7","doi-asserted-by":"crossref","unstructured":"Sun H, Zhong J, Ma Y et al (2021) Timetraveler: reinforcement learning for temporal knowledge graph forecasting. arXiv:210904101","DOI":"10.18653\/v1\/2021.emnlp-main.655"},{"key":"4481_CR8","doi-asserted-by":"crossref","unstructured":"Park N, Liu F, Mehta P et al (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\u2013803","DOI":"10.1145\/3488560.3498451"},{"key":"4481_CR9","doi-asserted-by":"crossref","unstructured":"Jin W, Qu M, Jin X et al (2019) Recurrent event network: autoregressive structure inference over temporal knowledge graphs. arXiv:190405530","DOI":"10.18653\/v1\/2020.emnlp-main.541"},{"key":"4481_CR10","doi-asserted-by":"crossref","unstructured":"Li Z, Jin X, Li W et al (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\u2013417","DOI":"10.1145\/3404835.3462963"},{"key":"4481_CR11","doi-asserted-by":"crossref","unstructured":"Cho K, Van Merri\u00ebnboer B, Gulcehre C et al (2014) Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv:14061078","DOI":"10.3115\/v1\/D14-1179"},{"key":"4481_CR12","unstructured":"Bordes A, Usunier N, Garcia-Duran A et al (2013) Translating embeddings for modeling multi-relational data. Adv Neural Inf Process Syst, vol 26"},{"key":"4481_CR13","doi-asserted-by":"crossref","unstructured":"Lin Y, Liu Z, Sun M et al (2015) Learning entity and relation embeddings for knowledge graph completion. In: Twenty-ninth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"4481_CR14","doi-asserted-by":"crossref","unstructured":"Ji G, He S, Xu L et al (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\u2013696","DOI":"10.3115\/v1\/P15-1067"},{"key":"4481_CR15","doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang J, Feng J et al (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"4481_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.knosys.2020.105808","volume":"196","author":"Y Zhao","year":"2020","unstructured":"Zhao Y, Zhang A, Feng H et al (2020) Knowledge graph entity typing via learning connecting embeddings. Knowl-Based Syst 196:105\u2013808","journal-title":"Knowl-Based Syst"},{"key":"4481_CR17","unstructured":"Yang B, Yih Wt, He X et al (2014) Embedding entities and relations for learning and inference in knowledge bases. arXiv:14126575"},{"key":"4481_CR18","unstructured":"Trouillon T, Welbl J, Riedel S et al (2016) Complex embeddings for simple link prediction. In: International conference on machine learning, PMLR, pp 2071\u20132080"},{"key":"4481_CR19","unstructured":"Kazemi SM, Poole D (2018) Simple embedding for link prediction in knowledge graphs. Adv Neural Inf Process Syst, vol 31"},{"key":"4481_CR20","unstructured":"Zhang S, Tay Y, Yao L et al (2019) Quaternion knowledge graph embeddings. Adv Neural Inf Process Syst, vol 32"},{"key":"4481_CR21","doi-asserted-by":"crossref","unstructured":"Bala\u017eevi\u0107 I, Allen C, Hospedales TM (2019) Tucker: tensor factorization for knowledge graph completion. arXiv:190109590","DOI":"10.18653\/v1\/D19-1522"},{"key":"4481_CR22","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv:160902907"},{"key":"4481_CR23","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A et al (2017) Graph attention networks. arXiv:171010903"},{"key":"4481_CR24","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf TN, Bloem P et al (2018) Modeling relational data with graph convolutional networks. In: European semantic web conference. Springer, pp 593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"4481_CR25","unstructured":"Vashishth S, Sanyal S, Nitin V et al (2019) Composition-based multi-relational graph convolutional networks. arXiv:191103082"},{"issue":"7","key":"4481_CR26","doi-asserted-by":"publisher","first-page":"7985","DOI":"10.1007\/s10489-021-02876-4","volume":"52","author":"J Huang","year":"2022","unstructured":"Huang J, Lu T, Zhu J et al (2022) Multi-relational knowledge graph completion method with local information fusion. Appl Intell 52(7):7985\u20137994","journal-title":"Appl Intell"},{"key":"4481_CR27","doi-asserted-by":"crossref","unstructured":"Zhang Z, Zhuang F, Zhu H et al (2020) Relational graph neural network with hierarchical attention for knowledge graph completion. In: Proceedings of the AAAI conference on artificial intelligence, pp 9612\u20139619","DOI":"10.1609\/aaai.v34i05.6508"},{"key":"4481_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.knosys.2021.107500","volume":"233","author":"Y Wang","year":"2021","unstructured":"Wang Y, Wang H, He J et al (2021) agat: type-aware graph attention networks for reasoning over knowledge graphs. Knowl-Based Syst 233:107\u2013500","journal-title":"Knowl-Based Syst"},{"key":"4481_CR29","unstructured":"Kou X, Lin Y, Li Y et al (2020a) Disene: disentangling knowledge graph embeddings. arXiv:201014730"},{"key":"4481_CR30","doi-asserted-by":"crossref","unstructured":"Kou X, Lin Y, Liu S et al (2020b) Disentangle-based continual graph representation learning. arXiv:201002565","DOI":"10.18653\/v1\/2020.emnlp-main.237"},{"key":"4481_CR31","doi-asserted-by":"crossref","unstructured":"Wu J, Shi W, Cao X et al (2021) Disenkgat: knowledge graph embedding with disentangled graph attention network. In: Proceedings of the 30th ACM international conference on information & knowledge management, pp 2140\u20132149","DOI":"10.1145\/3459637.3482424"},{"key":"4481_CR32","doi-asserted-by":"crossref","unstructured":"Dettmers T, Minervini P, Stenetorp P et al (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"4481_CR33","doi-asserted-by":"crossref","unstructured":"Vashishth S, Sanyal S, Nitin V et al (2020) Interacte: improving convolution-based knowledge graph embeddings by increasing feature interactions. In: Proceedings of the AAAI conference on artificial intelligence, pp 3009\u20133016","DOI":"10.1609\/aaai.v34i03.5694"},{"key":"4481_CR34","doi-asserted-by":"crossref","unstructured":"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\u20132011","DOI":"10.18653\/v1\/D18-1225"},{"key":"4481_CR35","doi-asserted-by":"crossref","unstructured":"Wu J, Cao M, Cheung JCK et al (2020) Temp: temporal message passing for temporal knowledge graph completion. arXiv:201003526","DOI":"10.18653\/v1\/2020.emnlp-main.462"},{"key":"4481_CR36","doi-asserted-by":"crossref","unstructured":"Jung J, Jung J, Kang U (2020) T-gap: learning to walk across time for temporal knowledge graph completion. arXiv:201210595","DOI":"10.1145\/3447548.3467292"},{"key":"4481_CR37","doi-asserted-by":"crossref","unstructured":"Yu M, Guo J, Yu J et al (2022) Tbdri: block decomposition based on relational interaction for temporal knowledge graph completion. Appl Intell:1\u201313","DOI":"10.1007\/s10489-022-03601-5"},{"key":"4481_CR38","doi-asserted-by":"crossref","unstructured":"Liu Y, Ma Y, Hildebrandt M et al (2022) Tlogic: temporal logical rules for explainable link forecasting on temporal knowledge graphs. In: Proceedings of the AAAI conference on artificial intelligence, pp 4120\u20134127","DOI":"10.1609\/aaai.v36i4.20330"},{"key":"4481_CR39","doi-asserted-by":"crossref","unstructured":"Garg S, Sharma N, Jin W et al (2020) Temporal attribute prediction via joint modeling of multi-relational structure evolution. arXiv:200303919","DOI":"10.24963\/ijcai.2020\/386"},{"key":"4481_CR40","doi-asserted-by":"crossref","unstructured":"Dey R, Salem FM (2017) Gate-variants of gated recurrent unit (gru) neural networks. In: 2017 IEEE 60th international midwest symposium on circuits and systems (MWSCAS). IEEE, pp 1597\u20131600","DOI":"10.1109\/MWSCAS.2017.8053243"},{"key":"4481_CR41","doi-asserted-by":"crossref","unstructured":"Shang C, Tang Y, Huang J et al (2019) End-to-end structure-aware convolutional networks for knowledge base completion. In: Proceedings of the AAAI conference on artificial intelligence, pp 3060\u20133067","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"4481_CR42","unstructured":"Trivedi R, Dai H, Wang Y et al (2017) Know-evolve: deep temporal reasoning for dynamic knowledge graphs. In: International conference on machine learning. PMLR, pp 3462\u20133471"},{"key":"4481_CR43","unstructured":"Boschee E, Lautenschlager J, O\u2019Brien S et al (2015) Icews coded event data. Harvard Dataverse, vol 12"},{"issue":"10","key":"4481_CR44","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrande\u010di\u0107","year":"2014","unstructured":"Vrande\u010di\u0107 D, Kr\u00f6tzsch M (2014) Wikidata: a free collaborative knowledgebase. Commun ACM 57(10):78\u201385","journal-title":"Commun ACM"},{"key":"4481_CR45","unstructured":"Mahdisoltani F, Biega J, Suchanek F (2014) Yago3: a knowledge base from multilingual wikipedias. In: 7th Biennial conference on innovative data systems research, CIDR conference"},{"key":"4481_CR46","unstructured":"Van Der Maaten L, Hinton G (2008) Visualizing data using t-sne. J Mach Learn Res, vol 9(11)"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04481-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04481-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04481-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T05:10:14Z","timestamp":1693199414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04481-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,2]]},"references-count":46,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["4481"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04481-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,2]]},"assertion":[{"value":"19 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}