{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:33:38Z","timestamp":1780497218066,"version":"3.54.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876207"],"award-info":[{"award-number":["61876207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research and Development Project in Key Areas of Guangdong Province","award":["2018B010109004"],"award-info":[{"award-number":["2018B010109004"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2980859","type":"journal-article","created":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T02:29:46Z","timestamp":1584412186000},"page":"51315-51323","source":"Crossref","is-referenced-by-count":39,"title":["Improving Graph Convolutional Networks Based on Relation-Aware Attention for End-to-End Relation Extraction"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5343-0440","authenticated-orcid":false,"given":"Yin","family":"Hong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5113-037X","authenticated-orcid":false,"given":"Yanxia","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5984-8901","authenticated-orcid":false,"given":"Suizhu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7518-5191","authenticated-orcid":false,"given":"Kaiwen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3104-0510","authenticated-orcid":false,"given":"Aiqing","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8725-6660","authenticated-orcid":false,"given":"Jianjun","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1159"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3115\/1596374.1596399"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1113"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1181"},{"key":"ref31","first-page":"2537","article-title":"Table filling multi-task recurrent neural network for joint entity and relation extraction","author":"gupta","year":"2016","journal-title":"Proc COLING 26th Int Conf Comput Linguistics Tech Papers"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2955977"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2938986"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1085"},{"key":"ref40","article-title":"Graph attention networks","author":"veli?kovi?","year":"2017","journal-title":"arXiv 1710 10903"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1249"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1131"},{"key":"ref13","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016","journal-title":"arXiv 1609 02907"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1047"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1136"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00104"},{"key":"ref17","first-page":"751","article-title":"Graphie: A graph-based framework for information extraction","volume":"1","author":"qian","year":"2019","journal-title":"Proc 2019 Conf North Amer Chapter Assoc Comput Linguistics Hum Lang Technol"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1399"},{"key":"ref19","first-page":"2335","article-title":"Relation classification via convolutional deep neural network","author":"zeng","year":"2014","journal-title":"Proc 25th Int Conf Comput Linguistics Tech Papers (COLING)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358119"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-1030"},{"key":"ref27","article-title":"Simple BERT models for relation extraction and semantic role labeling","author":"shi","year":"2019","journal-title":"arXiv 1904 05255"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1064"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1200"},{"key":"ref29","article-title":"Fine-tune bert for DocRED with two-step process","author":"wang","year":"2019","journal-title":"arXiv 1909 11898"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1244"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052708"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P14-1038"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1234"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1105"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-2053"},{"key":"ref46","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2966303"},{"key":"ref45","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"srivastava","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1206"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2891770"},{"key":"ref42","first-page":"179","article-title":"Creating training corpora for NLG micro-planning","author":"gardent","year":"2017","journal-title":"Proc Ann Meeting on Assoc for Computational Linguistics (ACL)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00049"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15939-8_10"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1062"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P14-5010"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1128"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017072"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1150"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09036871.pdf?arnumber=9036871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:09:14Z","timestamp":1641949754000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9036871\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2980859","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}