{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T22:39:20Z","timestamp":1792795160495,"version":"4.5.0"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Spanish Ministry of Science, Innovation and Universities","award":["PID2019-105471RB-I00"],"award-info":[{"award-number":["PID2019-105471RB-I00"]}],"id":[{"id":"https:\/\/ror.org\/05r0vyz12","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Office for Economy and Knowledge of the Andalusian Regional Government","award":["P18-RT-1060"],"award-info":[{"award-number":["P18-RT-1060"]}]},{"name":"Office for Economy and Knowledge of the Andalusian Regional Government","award":["US-1380565"],"award-info":[{"award-number":["US-1380565"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3220241","type":"journal-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T17:40:40Z","timestamp":1667842840000},"page":"125867-125880","source":"Crossref","is-referenced-by-count":21,"title":["Completing Scientific Facts in Knowledge Graphs of Research Concepts"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3750-8484","authenticated-orcid":false,"given":"Agustin","family":"Borrego","sequence":"first","affiliation":[{"name":"Department of Computer Languages and Systems, University of Seville, Seville, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danilo","family":"Dessi","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Cagliari, Cagliari, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Inma","family":"Hernandez","sequence":"additional","affiliation":[{"name":"Department of Computer Languages and Systems, University of Seville, Seville, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6557-3131","authenticated-orcid":false,"given":"Francesco","family":"Osborne","sequence":"additional","affiliation":[{"name":"Knowledge Media Institute, The Open University, Milton Keynes, U.K"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8646-6183","authenticated-orcid":false,"given":"Diego","family":"Reforgiato Recupero","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Cagliari, Cagliari, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4460-5493","authenticated-orcid":false,"given":"David","family":"Ruiz","sequence":"additional","affiliation":[{"name":"Department of Computer Languages and Systems, University of Seville, Seville, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1112-3789","authenticated-orcid":false,"given":"Davide","family":"Buscaldi","sequence":"additional","affiliation":[{"name":"LIPN, CNRS (UMR 7030),, Sorbonne Paris North University, Villetaneuse, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0015-1952","authenticated-orcid":false,"given":"Enrico","family":"Motta","sequence":"additional","affiliation":[{"name":"Knowledge Media Institute, The Open University, Milton Keynes, U.K"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.3115\/1073445.1073478"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1034"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30760-8_26"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1585"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013363"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1173"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5205-8"},{"key":"ref33","first-page":"1","article-title":"Analogical inference for multi-relational embeddings","volume":"70","author":"liu","year":"2017","journal-title":"Proc ICML"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"ref31","first-page":"1","article-title":"SimpLE embedding for link prediction in knowledge graphs","author":"kazemi","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"ref37","article-title":"RoBERTa: A robustly optimized BERT pretraining approach","author":"liu","year":"2019","journal-title":"arXiv 1907 11692"},{"key":"ref36","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume":"2","author":"mikolov","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3191513"},{"key":"ref34","first-page":"926","article-title":"Reasoning with neural tensor networks for knowledge base completion","author":"socher","year":"0","journal-title":"Adv NIPS"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3360901.3364418"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5363-6"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1162\/dint_a_00055"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975673.72"},{"key":"ref64","first-page":"2052","article-title":"Revisiting evaluation of knowledge base completion models","author":"pezeshkpour","year":"2020","journal-title":"Proc AKBC"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104302"},{"key":"ref65","article-title":"Ranking vs. classifying: Measuring knowledge base completion quality","author":"speranskaya","year":"2020","journal-title":"Proc AKBC"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.2307\/2531595"},{"key":"ref29","article-title":"Graph neural networks: A review of methods and applications","author":"zhou","year":"2018","journal-title":"arXiv 1812 08434"},{"key":"ref67","article-title":"Unsupervised key-phrase extraction and clustering for classification scheme in scientific publications","author":"li","year":"2021","journal-title":"arXiv 2101 09990"},{"key":"ref68","first-page":"1","article-title":"Understanding class representations: An intrinsic evaluation of zero-shot text classification","volume":"3034","author":"hoppe","year":"2021","journal-title":"Proc Workshop Deep Learn Knowl Graphs (DL4KG ISWC2021)"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.10.026"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62466-8_9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i1.2642"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-61244-3_16"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21348-0_26"},{"key":"ref21","first-page":"33","article-title":"Representing scientific literature evolution via temporal knowledge graphs","author":"rossanez","year":"2020","journal-title":"Proc MEPDaW ISWC"},{"key":"ref24","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","author":"bordes","year":"2013","journal-title":"Proc NIPS"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3390\/electronics9050750"},{"key":"ref26","first-page":"2071","article-title":"Complex embeddings for simple link prediction","volume":"48","author":"trouillon","year":"2016","journal-title":"Proc 33rd Int Conf Int Conf Mach Learn (ICML)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187874"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3105183"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-2024"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.3390\/electronics10070779"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/1989656.1989657"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412023"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1067"},{"key":"ref52","first-page":"1","article-title":"Flexible and extensible competency management with knowledge graphs","volume":"2980","author":"heist","year":"2021","journal-title":"Proc ISWC (Posters\/Demos\/Industry)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1162\/qss_a_00167"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/166"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkt328"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/ISU-2010-0613","article-title":"The anatomy of a nanopublication","volume":"30","author":"groth","year":"2010","journal-title":"Inform Services Use"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.78"},{"key":"ref14","first-page":"1","article-title":"Using the micropublications ontology and the open annotation data model to represent evidence within a drug-drug interaction knowledge base","author":"schneider","year":"2014","journal-title":"Proc LISC ISWC"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00668-6_12"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00668-6_8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3447772"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49004-5_50"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh061"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3360901.3364435"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77385-4_28"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.113053"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47602-5_18"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2008.03.004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3442442.3451361"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-49461-2_15"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1087\/2009202"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/728"},{"key":"ref45","first-page":"1","article-title":"Graph attention networks","author":"veli?kovi?","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.02.100"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3460210.3493582"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/250"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1060"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1466"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013060"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09940925.pdf?arnumber=9940925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T14:32:30Z","timestamp":1672065150000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9940925\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":74,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3220241","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}