{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T18:28:02Z","timestamp":1772303282960,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T00:00:00Z","timestamp":1624320000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T00:00:00Z","timestamp":1624320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key R&D Program of China","award":["No. 2018YFC0807500"],"award-info":[{"award-number":["No. 2018YFC0807500"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. U19A2059"],"award-info":[{"award-number":["No. U19A2059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Science and Technology of Sichuan Province Program","award":["No.2018GZDZX0048"],"award-info":[{"award-number":["No.2018GZDZX0048"]}]},{"name":"Ministry of Science and Technology of Sichuan Province Program","award":["20ZDYF0343"],"award-info":[{"award-number":["20ZDYF0343"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00521-021-06221-1","type":"journal-article","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T09:03:02Z","timestamp":1624352582000},"page":"16005-16017","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A structure distinguishable graph attention network for knowledge base completion"],"prefix":"10.1007","volume":"33","author":[{"given":"Xue","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bei","family":"Hui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0719-9556","authenticated-orcid":false,"given":"Lizong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kexi","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,22]]},"reference":[{"key":"6221_CR1","doi-asserted-by":"publisher","unstructured":"Suchanek FM, Kasneci G, Weikum G (2007) Yago: a core of semantic knowledge. In: Proceedings of the 16th international conference on World Wide Web, pp 697\u2013706, https:\/\/doi.org\/10.1145\/1242572.1242667","DOI":"10.1145\/1242572.1242667"},{"key":"6221_CR2","doi-asserted-by":"crossref","unstructured":"Carlson A, Betteridge J, Kisiel B, Settles B, Hruschka E, Mitchell T (2010) Toward an architecture for never-ending language learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 24","DOI":"10.1609\/aaai.v24i1.7519"},{"issue":"10","key":"6221_CR3","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. Comm ACM 57(10):78\u201385. https:\/\/doi.org\/10.1145\/2629489","journal-title":"Comm ACM"},{"key":"6221_CR4","doi-asserted-by":"publisher","unstructured":"Choi E, Kwiatkowski T, Zettlemoyer L (2015) Scalable semantic parsing with partial ontologies. 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 1311\u20131320, https:\/\/doi.org\/10.3115\/v1\/P15-1127","DOI":"10.3115\/v1\/P15-1127"},{"key":"6221_CR5","unstructured":"Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. In: Neural Information Processing Systems (NIPS), pp 1\u20139"},{"key":"6221_CR6","doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang J, Feng J, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 28","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"6221_CR7","doi-asserted-by":"crossref","unstructured":"Lin Y, Liu Z, Sun M, Liu Y, Zhu X (2015) Learning entity and relation embeddings for knowledge graph completion. In: Proceedings of the AAAI Conference on Artificial Intelligence, 29","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"6221_CR8","unstructured":"Trouillon T, Dance CR, Welbl J, Riedel S, Gaussier \u00c9, Bouchard G (2017) Knowledge graph completion via complex tensor factorization. arXiv preprint arXiv:170206879"},{"key":"6221_CR9","doi-asserted-by":"publisher","unstructured":"Bala\u017eevi\u0107 I, Allen C, Hospedales TM (2019) Tucker: Tensor factorization for knowledge graph completion. arXiv preprint arXiv:190109590 https:\/\/doi.org\/10.18653\/v1\/D19-1522","DOI":"10.18653\/v1\/D19-1522"},{"key":"6221_CR10","doi-asserted-by":"publisher","unstructured":"Nguyen DQ, Nguyen TD, Nguyen DQ, Phung D (2017) A novel embedding model for knowledge base completion based on convolutional neural network. arXiv preprint arXiv:171202121 https:\/\/doi.org\/10.18653\/v1\/N18-2053","DOI":"10.18653\/v1\/N18-2053"},{"key":"6221_CR11","doi-asserted-by":"crossref","unstructured":"Dettmers T, Minervini P, Stenetorp P, Riedel S (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 32","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"6221_CR12","doi-asserted-by":"publisher","unstructured":"Vu T, Nguyen TD, Nguyen DQ, Phung D, et\u00a0al. (2019) A capsule network-based embedding model for knowledge graph completion and search personalization. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pp 2180\u20132189, https:\/\/doi.org\/10.18653\/v1\/N19-1226","DOI":"10.18653\/v1\/N19-1226"},{"key":"6221_CR13","unstructured":"Xu K, Li C, Tian Y, Sonobe T, Kawarabayashi Ki, Jegelka S (2018b) Representation learning on graphs with jumping knowledge networks. In: International Conference on Machine Learning, PMLR, pp 5453\u20135462"},{"key":"6221_CR14","unstructured":"Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. In: International Conference on Machine Learning, PMLR, pp 1263\u20131272"},{"key":"6221_CR15","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf TN, Bloem P, Van Den\u00a0Berg R, Titov I, Welling M (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":"6221_CR16","doi-asserted-by":"publisher","unstructured":"Shang C, Tang Y, Huang J, Bi J, He X, Zhou B (2019) End-to-end structure-aware convolutional networks for knowledge base completion. Proceedings of the AAAI Conference on Artificial Intelligence 33: 3060\u20133067. https:\/\/doi.org\/10.1609\/AAAI.V33I01.33013060","DOI":"10.1609\/AAAI.V33I01.33013060"},{"key":"6221_CR17","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:171010903"},{"key":"6221_CR18","unstructured":"Thekumparampil KK, Wang C, Oh S, Li LJ (2018) Attention-based graph neural network for semi-supervised learning. arXiv preprint arXiv:180303735"},{"key":"6221_CR19","doi-asserted-by":"crossref","unstructured":"Lee JB, Rossi R, Kong X (2018) Graph classification using structural attention. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 1666\u20131674","DOI":"10.1145\/3219819.3219980"},{"key":"6221_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3007534","author":"Y Ji","year":"2020","unstructured":"Ji Y, Zhang H, Jie Z, Ma L, Wu QJ (2020) Casnet: a cross-attention siamese network for video salient object detection. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2020.3007534","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"6221_CR21","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2018a) How powerful are graph neural networks? arXiv preprint arXiv:181000826"},{"issue":"9","key":"6221_CR22","first-page":"12","volume":"2","author":"B Weisfeiler","year":"1968","unstructured":"Weisfeiler B, Leman A (1968) The reduction of a graph to canonical form and the algebra which appears therein. NTI, Series 2(9):12\u201316","journal-title":"NTI, Series"},{"key":"6221_CR23","unstructured":"Yang B, Yih Wt, He X, Gao J, Deng L (2014) Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:14126575"},{"key":"6221_CR24","first-page":"3065","volume":"34","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Cai J, Zhang Y, Wang J (2020) Learning hierarchy-aware knowledge graph embeddings for link prediction. Proceed AAAI Conf Artif Intell 34:3065\u20133072","journal-title":"Proceed AAAI Conf Artif Intell"},{"key":"6221_CR25","unstructured":"Nickel M, Tresp V, Kriegel HP (2011) A three-way model for collective learning on multi-relational data. In: Icml"},{"key":"6221_CR26","unstructured":"Zhang Z, Cai J, Wang J (2020a) Duality-induced regularizer for tensor factorization based knowledge graph completion. arXiv preprint arXiv:201105816"},{"key":"6221_CR27","unstructured":"Sabour S, Frosst N, Hinton GE (2017) Dynamic routing between capsules. arXiv preprint arXiv:171009829"},{"issue":"4","key":"6221_CR28","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MNET.2018.1700349","volume":"32","author":"Y Liang","year":"2018","unstructured":"Liang Y, Cai Z, Yu J, Han Q, Li Y (2018) Deep learning based inference of private information using embedded sensors in smart devices. IEEE Netw 32(4):8\u201314. https:\/\/doi.org\/10.1109\/MNET.2018.1700349","journal-title":"IEEE Netw"},{"key":"6221_CR29","doi-asserted-by":"publisher","unstructured":"Li K, Lu G, Luo G, Cai Z (2020) Seed-free graph de-anonymiztiation with adversarial learning. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp 745\u2013754, https:\/\/doi.org\/10.1145\/3340531.3411970","DOI":"10.1145\/3340531.3411970"},{"key":"6221_CR30","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:160902907"},{"key":"6221_CR31","doi-asserted-by":"publisher","unstructured":"Nathani D, Chauhan J, Sharma C, Kaul M (2019) Learning attention-based embeddings for relation prediction in knowledge graphs. arXiv preprint arXiv:190601195 https:\/\/doi.org\/10.18653\/v1\/P19-1466","DOI":"10.18653\/v1\/P19-1466"},{"key":"6221_CR32","unstructured":"Xu X, Feng W, Jiang Y, Xie X, Sun Z, Deng ZH (2019) Dynamically pruned message passing networks for large-scale knowledge graph reasoning. arXiv preprint arXiv:190911334"},{"key":"6221_CR33","doi-asserted-by":"publisher","unstructured":"Bansal T, Juan DC, Ravi S, McCallum A (2019) A2n: Attending to neighbors for knowledge graph inference. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pp 4387\u20134392, https:\/\/doi.org\/10.18653\/v1\/P19-14316","DOI":"10.18653\/v1\/P19-14316"},{"issue":"5","key":"6221_CR34","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K Hornik","year":"1989","unstructured":"Hornik K, Stinchcombe M, White H (1989) Multilayer feedforward networks are universal approximators. Neural Netw 2(5):359\u2013366. https:\/\/doi.org\/10.1016\/0893-6080(89)90020-8","journal-title":"Neural Netw"},{"issue":"2","key":"6221_CR35","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K Hornik","year":"1991","unstructured":"Hornik K (1991) Approximation capabilities of multilayer feedforward networks. Neural Netw 4(2):251\u2013257. https:\/\/doi.org\/10.1016\/0893-6080(91)90009-T","journal-title":"Neural Netw"},{"key":"6221_CR36","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser L, Polosukhin I (2017) Attention is all you need. arXiv preprint arXiv:170603762"},{"key":"6221_CR37","unstructured":"Kingma DP, Ba J (2014) Adam: A method for stochastic optimization. arXiv preprint arXiv:14126980"},{"key":"6221_CR38","doi-asserted-by":"publisher","unstructured":"Toutanova K, Chen D, Pantel P, Poon H, Choudhury P, Gamon M (2015) Representing text for joint embedding of text and knowledge bases. In: Proceedings of the 2015 conference on empirical methods in natural language processing, pp 1499\u20131509, https:\/\/doi.org\/10.18653\/v1\/D15-1174","DOI":"10.18653\/v1\/D15-1174"},{"issue":"2","key":"6221_CR39","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/TNSE.2018.2830307","volume":"7","author":"Z Cai","year":"2018","unstructured":"Cai Z, Zheng X (2018) A private and efficient mechanism for data uploading in smart cyber-physical systems. IEEE Trans Netw Sci Eng 7(2):766\u2013775. https:\/\/doi.org\/10.1109\/TNSE.2018.2830307","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"4","key":"6221_CR40","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1109\/TKDE.2016.2645212","volume":"29","author":"S Cheng","year":"2017","unstructured":"Cheng S, Cai Z, Li J, Gao H (2017) Extracting kernel dataset from big sensory data in wireless sensor networks. IEEE Trans Knowl Data Eng 29(4):813\u2013827. https:\/\/doi.org\/10.1109\/TKDE.2016.2645212","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"6221_CR41","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s00778-017-0490-5","volume":"27","author":"Y Wu","year":"2018","unstructured":"Wu Y, Zhang X, Bian Y, Cai Z, Lian X, Liao X, Zhao F (2018) Second-order random walk-based proximity measures in graph analysis: formulations and algorithms. VLDB J 27(1):127\u2013152. https:\/\/doi.org\/10.1007\/s00778-017-0490-5","journal-title":"VLDB J"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06221-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06221-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06221-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T04:24:00Z","timestamp":1672547040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06221-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,22]]},"references-count":41,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["6221"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06221-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,22]]},"assertion":[{"value":"28 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":3,"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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest\/Competing interests"}},{"value":"All data, models, and code generated or used during the study appear in","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"The authors declare that they do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}