{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T05:11:12Z","timestamp":1768885872051,"version":"3.49.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T00:00:00Z","timestamp":1746576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T00:00:00Z","timestamp":1746576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62262006"],"award-info":[{"award-number":["62262006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017691","name":"Guangxi Key Research and Development Program","doi-asserted-by":"publisher","award":["AB23026048"],"award-info":[{"award-number":["AB23026048"]}],"id":[{"id":"10.13039\/501100017691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2019GXNSFDA185007"],"award-info":[{"award-number":["2019GXNSFDA185007"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10489-025-06592-1","type":"journal-article","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:41:01Z","timestamp":1746592861000},"update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Linear self-attention with multi-relational graph for knowledge graph completion"],"prefix":"10.1007","volume":"55","author":[{"given":"Weida","family":"Liu","sequence":"first","affiliation":[]},{"given":"Baohua","family":"Qiang","sequence":"additional","affiliation":[]},{"given":"Ruidong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Lirui","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zhiqin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,7]]},"reference":[{"key":"6592_CR1","doi-asserted-by":"crossref","unstructured":"Liu Y, Wan Y, He L, et\u00a0al (2021) Kg-bart: Knowledge graph-augmented bart for generative commonsense reasoning. https:\/\/linproxy.fan.workers.dev:443\/https\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/16796","DOI":"10.1609\/aaai.v35i7.16796"},{"key":"6592_CR2","doi-asserted-by":"publisher","unstructured":"Luo X, Liu L, Yang Y, et\u00a0al (2020) Alicoco: Alibaba e-commerce cognitive concept net. Association for Computing Machinery, New York, NY, USA, SIGMOD \u201920, p 313\u2013327, https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/3318464.3386132","DOI":"10.1145\/3318464.3386132"},{"key":"6592_CR3","doi-asserted-by":"publisher","unstructured":"Cheng D, Yang F, Wang X, et\u00a0al (2020) Knowledge graph-based event embedding framework for financial quantitative investments. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval. Ass Comput Mach, p 2221\u20132230. https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/3397271.3401427","DOI":"10.1145\/3397271.3401427"},{"key":"6592_CR4","doi-asserted-by":"publisher","unstructured":"Geng S, Fu Z, Tan J, et\u00a0al (2022) Path language modeling over knowledge graphsfor explainable recommendation. Proceed ACM Web Conf 2022 pp 946\u2013955. https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/3485447.3511937","DOI":"10.1145\/3485447.3511937"},{"key":"6592_CR5","doi-asserted-by":"crossref","unstructured":"Li Z, Zhao Y, Zhang Y, et\u00a0al (2022) Multi-relational graph attention networks for knowledge graph completion. Knowl-Based Syst 251:109262. https:\/\/linproxy.fan.workers.dev:443\/https\/www.sciencedirect.com\/science\/article\/pii\/S0950705122006311","DOI":"10.1016\/j.knosys.2022.109262"},{"key":"6592_CR6","doi-asserted-by":"crossref","unstructured":"Li X, Tian Y, Ji S (2024) Semantic-and relation-based graph neural network for knowledge graph completion. Appl Intell pp 1\u201323. https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10489-024-05482-2","DOI":"10.2139\/ssrn.4455564"},{"key":"6592_CR7","doi-asserted-by":"crossref","unstructured":"Bollacker K, Evans C, Paritosh P, et\u00a0al (2008) Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp 1247\u20131250. https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/abs\/10.1145\/1376616.1376746","DOI":"10.1145\/1376616.1376746"},{"key":"6592_CR8","doi-asserted-by":"crossref","unstructured":"Auer S, Bizer C, Kobilarov G, et\u00a0al (2007) Dbpedia: A nucleus for a web of open data. In: international semantic web conference, Springer, pp 722\u2013735. https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/chapter\/10.1007\/978-3-540-76298-0_52","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"6592_CR9","doi-asserted-by":"crossref","unstructured":"Carlson A, Betteridge J, Kisiel B, et\u00a0al (2010) Toward an architecture for never-ending language learning. In: Proceedings of the AAAI conference on artificial intelligence, pp 1306\u20131313. https:\/\/linproxy.fan.workers.dev:443\/https\/ojs.aaai.org\/index.php\/AAAI\/ARTICLE\/view\/7519","DOI":"10.1609\/aaai.v24i1.7519"},{"key":"6592_CR10","doi-asserted-by":"publisher","unstructured":"Vrande\u010di\u0107 D, Kr\u00f6tzsch M (2014) Wikidata: a free collaborative knowledgebase. Commun ACM 57(10):78\u201385. https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/2629489","DOI":"10.1145\/2629489"},{"key":"6592_CR11","doi-asserted-by":"crossref","unstructured":"Li W, Peng R, Li Z (2022) Improving knowledge graph completion via increasing embedding interactions. Appl Intell 52(8):9289\u20139307. https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10489-021-02947-6","DOI":"10.1007\/s10489-021-02947-6"},{"key":"6592_CR12","doi-asserted-by":"crossref","unstructured":"Baghershahi P, Hosseini R, Moradi H (2023) Self-attention presents low-dimensional knowledge graph embeddings for link prediction. Knowl-Based Syst 260:110124. https:\/\/linproxy.fan.workers.dev:443\/https\/www.sciencedirect.com\/science\/article\/pii\/S0950705122012205","DOI":"10.1016\/j.knosys.2022.110124"},{"key":"6592_CR13","doi-asserted-by":"crossref","unstructured":"Liu L, Huang W, Shu J, et\u00a0al (2025) Knowledge graph relation prediction based on graph transformation. Appl Intell 55(3):241. https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10489-024-06080-y","DOI":"10.1007\/s10489-024-06080-y"},{"key":"6592_CR14","doi-asserted-by":"crossref","unstructured":"Zhang Z, Wang J, Ye J, et\u00a0al (2022) Rethinking graph convolutional networks in knowledge graph completion. In: Proceedings of the ACM web conference 2022, pp 798\u2013807. https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/abs\/10.1145\/3485447.3511923","DOI":"10.1145\/3485447.3511923"},{"key":"6592_CR15","doi-asserted-by":"crossref","unstructured":"Liu Z, Wang P, Ni C, et\u00a0al (2025) Proformer: a scalable graph transformer with linear complexity. Appl Intell 55(2):1\u201315. https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10489-024-06065-x","DOI":"10.1007\/s10489-024-06065-x"},{"key":"6592_CR16","doi-asserted-by":"crossref","unstructured":"Zhang P, Yan Y, Zhang X, et\u00a0al (2024) Transgnn: Harnessing the collaborative power of transformers and graph neural networks for recommender systems. In: Proceedings of the 47th International ACM SIGIR conference on research and development in information retrieval, pp 1285\u20131295. https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/abs\/10.1145\/3626772.3657721","DOI":"10.1145\/3626772.3657721"},{"key":"6592_CR17","unstructured":"Ben J, Sun Q, Liu K, et\u00a0al (2024) Multi-head multi-order graph attention networks. Appl Intell pp 1\u201316. https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10489-024-05601-z"},{"key":"6592_CR18","doi-asserted-by":"crossref","unstructured":"Yang M, Meng Z, King I (2020) Featurenorm: L2 feature normalization for dynamic graph embedding. In: 2020 IEEE International conference on data mining (ICDM), pp 731\u2013740. https:\/\/linproxy.fan.workers.dev:443\/https\/ieeexplore.ieee.org\/abstract\/document\/9338409","DOI":"10.1109\/ICDM50108.2020.00082"},{"key":"6592_CR19","doi-asserted-by":"crossref","unstructured":"He L, Bai L, Yang X, et\u00a0al (2023) High-order graph attention network. Inf Sci 630:222\u2013234. https:\/\/linproxy.fan.workers.dev:443\/https\/www.sciencedirect.com\/science\/article\/pii\/S0020025523002426","DOI":"10.1016\/j.ins.2023.02.054"},{"key":"6592_CR20","unstructured":"Ying C, Cai T, Luo S, et\u00a0al (2021) Do transformers really perform badly for graph representation? Adv Neural Inf Process Syst 34:28877\u201328888. https:\/\/linproxy.fan.workers.dev:443\/https\/proceedings.neurips.cc\/paper\/2021\/hash\/f1c1592588411002af340cbaedd6fc33-Abstract.html"},{"key":"6592_CR21","doi-asserted-by":"publisher","unstructured":"Hussain MS, Zaki MJ, Subramanian D (2022) Global self-attention as a replacement for graph convolution. In: Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining, pp 655\u2013665. https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/3534678.3539296","DOI":"10.1145\/3534678.3539296"},{"key":"6592_CR22","doi-asserted-by":"crossref","unstructured":"Ahmad WU, Peng N, Chang KW (2021) Gate: Graph attention transformer encoder for cross-lingual relation and event extraction. In: Proceedings of the AAAI conference on artificial intelligence, https:\/\/linproxy.fan.workers.dev:443\/https\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/17478","DOI":"10.1609\/aaai.v35i14.17478"},{"key":"6592_CR23","unstructured":"Ramp\u00e1\u0161ek L, Galkin M, Dwivedi VP, et\u00a0al (2022) Recipe for a general, powerful, scalable graph transformer. Adv Neural Inf Process Syst 35:14501\u201314515. https:\/\/linproxy.fan.workers.dev:443\/https\/proceedings.neurips.cc\/paper_files\/paper\/2022\/ hash\/5d4834a159f1547b267a05a4e2b7cf5e-Abstract-Conference.html"},{"key":"6592_CR24","unstructured":"Vaswani A (2017) Attention is all you need. Adv Neural Inf Process Syst https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.5555\/3295222.3295349"},{"key":"6592_CR25","unstructured":"Li S, Jin X, Xuan Y, et\u00a0al (2019) Enhancing the locality and breaking the memory bottleneck of transformer on time series forecasting https:\/\/linproxy.fan.workers.dev:443\/https\/proceedings.neurips.cc\/paper\/2019\/hash\/6775a0635c302542da2c32aa19d86be0-Abstract.html"},{"key":"6592_CR26","unstructured":"Wu Q, Zhao W, Yang C, et\u00a0al (2023) Sgformer: Simplifying and empowering transformers for large-graph representations. In: Oh A, Naumann T, Globerson A, et\u00a0al (eds) Adv Neural Inf Process Syst, vol\u00a036. Curran Associates, Inc., pp 64753\u201364773. https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.5555\/3666122.3668948"},{"key":"6592_CR27","unstructured":"Bordes A, Usunier N, Garcia-Duran A, et\u00a0al (2013) Translating embeddings for modeling multi-relational data. In: Burges C, Bottou L, Welling M, et\u00a0al (eds) Advances in Neural Information Processing Systems, vol\u00a026. Curran Associates, Inc., https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.5555\/2999792.2999923"},{"key":"6592_CR28","doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang J, Feng J, et\u00a0al (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI conference on artificial intelligence, https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.5555\/2893873.2894046","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"6592_CR29","doi-asserted-by":"publisher","unstructured":"Lin Y, Liu Z, Sun M, et\u00a0al (2015) Learning entity and relation embeddings for knowledge graph completion. https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.5555\/2886521.2886624","DOI":"10.5555\/2886521.2886624"},{"key":"6592_CR30","unstructured":"Yang B, Yih Wt, He X, et\u00a0al (2014) Embedding entities and relations for learning and inference in knowledge bases. In: International conference on learning representations"},{"key":"6592_CR31","unstructured":"Sun Z, Deng ZH, Nie JY, et\u00a0al (2019) Rotate: Knowledge graph embedding by relational rotation in complex space. In: International conference on learning representations, https:\/\/linproxy.fan.workers.dev:443\/https\/iclr.cc\/virtual\/2019\/poster\/870"},{"key":"6592_CR32","doi-asserted-by":"crossref","unstructured":"Lu H, Hu H, Lin X (2022) Dense: An enhanced non-commutative representation for knowledge graph embedding with adaptive semantic hierarchy. Neurocomput 476:115\u2013125. https:\/\/linproxy.fan.workers.dev:443\/https\/www.sciencedirect.com\/science\/article\/pii\/S0925231221019342","DOI":"10.1016\/j.neucom.2021.12.079"},{"key":"6592_CR33","unstructured":"Nguyen DQ, Nguyen TD, Nguyen DQ, et\u00a0al (2017) A novel embedding model for knowledge base completion based on convolutional neural network. In: North american chapter of the association for computational linguistics, pp 327\u2013333. https:\/\/linproxy.fan.workers.dev:443\/https\/aclanthology.org\/N18-2053"},{"key":"6592_CR34","doi-asserted-by":"crossref","unstructured":"Bala\u017eevi\u0107 I, Allen C, Hospedales TM (2018) Hypernetwork knowledge graph embeddings. In: International conference on artificial neural networks, https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/chapter\/10.1007\/978-3-030-30493-5_52","DOI":"10.1007\/978-3-030-30493-5_52"},{"key":"6592_CR35","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf TN, Bloem P, et\u00a0al (2018) Modeling relational data with graph convolutional networks. In: The semantic web: 15th international conference, ESWC 2018, Heraklion, Crete, Greece, 3\u20137 June, 2018, proceedings 15, Springer, pp 593\u2013607. https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/chapter\/10.1007\/978-3-319-93417-4_38","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"6592_CR36","doi-asserted-by":"crossref","unstructured":"Shang C, Tang Y, Huang J, et\u00a0al (2019) End-to-end structure-aware convolutional networks for knowledge base completion. In: Proceedings of the AAAI conference on artificial intelligence, pp 3060\u20133067. https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1609\/aaai.v33i01.33013060","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"6592_CR37","unstructured":"Vashishth S, Sanyal S, Nitin V, et\u00a0al (2020) Composition-based multi-relational graph convolutional networks. In: International conference on learning representations, https:\/\/linproxy.fan.workers.dev:443\/https\/openreview.net\/forum?id=BylA_C4tPr"},{"key":"6592_CR38","unstructured":"Choromanski K, Likhosherstov V, Dohan D, et\u00a0al (2021) Rethinking attention with performers. In: 9th International conference on learning representations, ICLR 2021, Virtual Event, Austria, 3-7 May, 2021, https:\/\/linproxy.fan.workers.dev:443\/https\/openreview.net\/forum?id=Ua6zuk0WRH"},{"key":"6592_CR39","doi-asserted-by":"crossref","unstructured":"Bolya D, Fu CY, Dai X, et\u00a0al (2022) Hydra attention: Efficient attention with many heads. In: ECCV Workshops, https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/chapter\/10.1007\/978-3-031-25082-8_3","DOI":"10.1007\/978-3-031-25082-8_3"},{"key":"6592_CR40","unstructured":"Katharopoulos A, Vyas A, Pappas N, et\u00a0al (2020) Transformers are rnns: Fast autoregressive transformers with linear attention. In: International conference on machine learning, PMLR, pp 5156\u20135165. https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/abs\/10.5555\/3524938.3525416"},{"key":"6592_CR41","doi-asserted-by":"crossref","unstructured":"Wu H, Chen S, Chen G, et\u00a0al (2021) Fat-net: Feature adaptive transformers for automated skin lesion segmentation. Med Image Anal 76:102327. https:\/\/linproxy.fan.workers.dev:443\/https\/www.sciencedirect.com\/science\/article\/abs\/pii\/S1361841521003728","DOI":"10.1016\/j.media.2021.102327"},{"key":"6592_CR42","unstructured":"Wu Z, Liu Z, Lin J, et\u00a0al (2020) Lite transformer with long-short range attention. In: International conference on learning representations (ICLR), https:\/\/linproxy.fan.workers.dev:443\/https\/iclr.cc\/virtual_2020\/poster_ByeMPlHKPH.html"},{"key":"6592_CR43","doi-asserted-by":"crossref","unstructured":"Sun C, Li C, Lin X, et\u00a0al (2023) Attention-based graph neural networks: a survey. Artif Intell Rev 56(Suppl 2):2263\u20132310. https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10462-023-10577-2","DOI":"10.1007\/s10462-023-10577-2"},{"key":"6592_CR44","unstructured":"Chen D, O\u2019Bray L, Borgwardt K (2022) Structure-aware transformer for graph representation learning. In: International conference on machine learning, https:\/\/linproxy.fan.workers.dev:443\/https\/proceedings.mlr.press\/v162\/chen22r.html"},{"key":"6592_CR45","unstructured":"Wu Z, Jain P, Wright M, et\u00a0al (2024) Representing long-range context for graph neural networks with global attention. In: Proceedings of the 35th international conference on neural information processing systems. Curran Associates Inc., Red Hook, NY, USA, NIPS \u201921, https:\/\/linproxy.fan.workers.dev:443\/https\/proceedings.neurips.cc\/paper\/2021\/hash\/6e67691b60ed3e4a55935261314dd534-Abstract.html"},{"key":"6592_CR46","doi-asserted-by":"publisher","unstructured":"Nishad S, Agarwal S, Bhattacharya A, et\u00a0al (2021) Graphreach: Position-aware graph neural network using reachability estimations. In: Zhou ZH (ed) Proceedings of the thirtieth international joint conference on artificial intelligence, IJCAI-21. Int Joint Conf Artif Intell Organiz, pp 1527\u20131533. https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.24963\/ijcai.2021\/211, https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.24963\/ijcai.2021\/211, main Track","DOI":"10.24963\/ijcai.2021\/211"},{"key":"6592_CR47","doi-asserted-by":"crossref","unstructured":"Nathani D, Chauhan J, Sharma C, et\u00a0al (2019) Learning attention-based embeddings for relation prediction in knowledge graphs. In: Annual meeting of the association for computational linguistics, pp 4710\u20134723. https:\/\/linproxy.fan.workers.dev:443\/https\/aclanthology.org\/P19-1466","DOI":"10.18653\/v1\/P19-1466"},{"key":"6592_CR48","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, et\u00a0al (2018) Graph attention networks. Int Conf Learn Represent https:\/\/linproxy.fan.workers.dev:443\/https\/openreview.net\/forum?id=rJXMpikCZ, accepted as poster"},{"key":"6592_CR49","doi-asserted-by":"crossref","unstructured":"Liang S, Shao J, Zhang D, et\u00a0al (2023) Drgi: Deep relational graph infomax for knowledge graph completion. IEEE Trans Knowl Data Eng 35(3):2486\u20132499. https:\/\/linproxy.fan.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/9531531","DOI":"10.1109\/TKDE.2023.3240832"},{"key":"6592_CR50","doi-asserted-by":"publisher","unstructured":"Tan Z, Chen Z, Feng S, et\u00a0al (2023) Kracl: Contrastive learning with graph context modeling for sparse knowledge graph completion. In: Proceedings of the ACM web conference 2023, pp 2548\u20132559. https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/3543507.3583412","DOI":"10.1145\/3543507.3583412"},{"key":"6592_CR51","doi-asserted-by":"crossref","unstructured":"Toutanova K, Chen D (2015) Observed versus latent features for knowledge base and text inference. In: Proceedings of the 3rd workshop on continuous vector space models and their compositionality, pp 57\u201366. https:\/\/linproxy.fan.workers.dev:443\/https\/aclanthology.org\/W15-4007.pdf","DOI":"10.18653\/v1\/W15-4007"},{"key":"6592_CR52","doi-asserted-by":"crossref","unstructured":"Dettmers T, Minervini P, Stenetorp P, et\u00a0al (2017) Convolutional 2d knowledge graph embeddings. In: AAAI conference on artificial intelligence, https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.5555\/3504035.3504256","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"6592_CR53","doi-asserted-by":"publisher","unstructured":"Lin XV, Socher R, Xiong C (2018) Multi-hop knowledge graph reasoning with reward shaping. In: Proceedings of the 2018 conference on empirical methods in natural language processing. Association for computational linguistics, Brussels, Belgium, pp 3243\u20133253. https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.18653\/v1\/D18-1362, https:\/\/linproxy.fan.workers.dev:443\/https\/aclanthology.org\/D18-1362","DOI":"10.18653\/v1\/D18-1362"},{"key":"6592_CR54","doi-asserted-by":"crossref","unstructured":"Kok S, Domingos P (2007) Statistical predicate invention. Ass Comput Mach, New York, NY, USA, ICML \u201907, p 433\u2013440. https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/1273496.1273551","DOI":"10.1145\/1273496.1273551"},{"key":"6592_CR55","unstructured":"Trouillon T, Welbl J, Riedel S, et\u00a0al (2016) Complex embeddings for simple link prediction. In: International conference on machine learning, PMLR, pp 2071\u20132080. https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.5555\/3045390.3045609"},{"key":"6592_CR56","doi-asserted-by":"crossref","unstructured":"Balazevic I, Allen C, Hospedales T (2019) TuckER: Tensor factorization for knowledge graph completion. In: Proceedings of the 2019 conference on empirical methods in natural language processing and the 9th international joint conference on natural language processing (EMNLP-IJCNLP). Ass Comput Linguist, pp 5185\u20135194. https:\/\/linproxy.fan.workers.dev:443\/https\/aclanthology.org\/D19-1522","DOI":"10.18653\/v1\/D19-1522"},{"key":"6592_CR57","doi-asserted-by":"crossref","unstructured":"Vashishth S, Sanyal S, Nitin V, et\u00a0al (2020) Interacte: Improving convolution-based knowledge graph embeddings by increasing feature interactions. In: Proceedings of the 34th AAAI conference on artificial intelligence. AAAI Press, pp 3009\u20133016. https:\/\/linproxy.fan.workers.dev:443\/https\/aaai.org\/ojs\/index.php\/AAAI\/ARTICLE\/view\/5694","DOI":"10.1609\/aaai.v34i03.5694"},{"key":"6592_CR58","unstructured":"Xu Z, Ye P, Chen H, et\u00a0al (2022) Ruleformer: Context-aware rule mining over knowledge graph. In: Proceedings of the 29th international conference on computational linguistics. International Committee on Computational Linguistics, Gyeongju, Republic of Korea, pp 2551\u20132560. https:\/\/linproxy.fan.workers.dev:443\/https\/aclanthology.org\/2022.coling-1.225"},{"key":"6592_CR59","doi-asserted-by":"crossref","unstructured":"Li D, Xia T, Wang J, et\u00a0al (2024) Sdformer: A shallow-to-deep feature interaction for knowledge graph embedding. Knowl Based Syst 284:111253. https:\/\/linproxy.fan.workers.dev:443\/https\/www.sciencedirect.com\/science\/article\/abs\/pii\/S095070512301002X","DOI":"10.1016\/j.knosys.2023.111253"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06592-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10489-025-06592-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06592-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T13:57:38Z","timestamp":1758290258000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/10.1007\/s10489-025-06592-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,7]]},"references-count":59,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["6592"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s10489-025-06592-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,7]]},"assertion":[{"value":"22 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2025","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"727"}}