{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:05:22Z","timestamp":1743156322074,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030757670"},{"type":"electronic","value":"9783030757687"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75768-7_30","type":"book-chapter","created":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T15:04:20Z","timestamp":1620399860000},"page":"377-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SaGCN: Structure-Aware Graph Convolution Network for Document-Level Relation Extraction"],"prefix":"10.1007","author":[{"given":"Shuangji","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taolin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danning","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Nong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,8]]},"reference":[{"key":"30_CR1","unstructured":"Bastings, J., Aziz, W., Titov, I.: Interpretable neural predictions with differentiable binary variables"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Beck, D., Haffari, G., Cohn, T.: Graph-to-sequence learning using gated graph neural networks. In: ACL (2018)","DOI":"10.18653\/v1\/P18-1026"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Christopoulou, F., Miwa, M., Ananiadou, S.: Connecting the dots: document-level neural relation extraction with edge-oriented graphs. In: EMNLP (2019)","DOI":"10.18653\/v1\/D19-1498"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Culotta, A., Sorensen, J.: Dependency tree kernels for relation extraction. In: ACL (2004)","DOI":"10.3115\/1218955.1219009"},{"key":"30_CR5","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. In: NAACL-HLT (2019)"},{"key":"30_CR6","unstructured":"Glorot, X., Bordes, A., Bengio, Y.: Deep sparse rectifier neural networks. In: AISTATS (2011)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Guo, Z., Nan, G., Lu, W., Cohen, S.B.: Learning latent forests for medical relation extraction. In: IJCAI (2020)","DOI":"10.24963\/ijcai.2020\/505"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Guo, Z., Zhang, Y., Lu, W.: Attention guided graph convolutional networks for relation extraction. In: ACL (2019)","DOI":"10.18653\/v1\/P19-1024"},{"key":"30_CR9","unstructured":"Gupta, P., Rajaram, S., Sch\u00fctze, H., Runkler, T.: Neural relation extraction within and across sentence boundaries. In: AAAI"},{"key":"30_CR10","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural computation"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Jia, R., Wong, C., Poon, H.: Document-level n-ary relation extraction with multiscale representation learning. In: NAACL (2019)","DOI":"10.18653\/v1\/N19-1370"},{"key":"30_CR12","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)"},{"key":"30_CR13","unstructured":"Koo, T., Globerson, A., Carreras, X., Collins, M.: Structured prediction models via the matrix-tree theorem. In: EMNLP-CoNLL (2007)"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-1694(80)90036-0","volume":"46","author":"P Kumaraswamy","year":"1980","unstructured":"Kumaraswamy, P.: A generalized probability density function for double-bounded random processes. J. Hydrol. 46, 79\u201388 (1980)","journal-title":"J. Hydrol."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wei, F., Li, S., Ji, H., Zhou, M., Wang, H.: A dependency-based neural network for relation classification. In: ACL-IJCNLP (2015)","DOI":"10.3115\/v1\/P15-2047"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Miwa, M., Bansal, M.: End-to-end relation extraction using LSTMs on sequences and tree structures. In: ACL (2016)","DOI":"10.18653\/v1\/P16-1105"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Nan, G., Guo, Z., Sekuli\u0107, I., Lu, W.: Reasoning with latent structure refinement for document-level relation extraction. In: ACL (2020)","DOI":"10.18653\/v1\/2020.acl-main.141"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Peng, N., Poon, H., Quirk, C., Toutanova, K., Yih, W.T.: Cross-sentence n-ary relation extraction with graph LSTMs. In: TACL (2017)","DOI":"10.1162\/tacl_a_00049"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Sahu, S.K., Christopoulou, F., Miwa, M., Ananiadou, S.: Inter-sentence relation extraction with document-level graph convolutional neural network. In: ACL (2019)","DOI":"10.18653\/v1\/P19-1423"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"2673","DOI":"10.1109\/78.650093","volume":"45","author":"M Schuster","year":"1997","unstructured":"Schuster, M., Paliwal, K.K.: Bidirectional recurrent neural networks. IEEE Trans. Signal Process. 45, 2673\u20132681 (1997)","journal-title":"IEEE Trans. Signal Process."},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Tai, K.S., Socher, R., Manning, C.D.: Improved semantic representations from tree-structured long short-term memory networks. In: ACL-IJCNLP (2015)","DOI":"10.3115\/v1\/P15-1150"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-030-47426-3_16","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Tang","year":"2020","unstructured":"Tang, H., et al.: HIN: hierarchical inference network for document-level relation extraction. In: Lauw, H.W., Wong, R.C.-W., Ntoulas, A., Lim, E.-P., Ng, S.-K., Pan, S.J. (eds.) PAKDD 2020. LNCS (LNAI), vol. 12084, pp. 197\u2013209. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-47426-3_16"},{"key":"30_CR23","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, \u0141., Polosukhin, I.: Attention is all you need. In: NIPS (2017)"},{"key":"30_CR24","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. In: ICLR (2018)"},{"key":"30_CR25","unstructured":"Veyseh, A.P.B., Dernoncourt, F., Dou, D., Nguyen, T.: Exploiting the syntax-model consistency for neural relation extraction. In: ACL (2020)"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Wang, D., Hu, W., Cao, E., Sun, W.: Global-to-local neural networks for document-level relation extraction. In: EMNLP (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.303"},{"key":"30_CR27","unstructured":"Wang, H., Focke, C., Sylvester, R., Mishra, N., Wang, W.: Fine-tune Bert for DOCred with two-step process. arXiv preprint arXiv:1909.11898 (2019)"},{"key":"30_CR28","unstructured":"Xiao, M., Liu, C.: Semantic relation classification via hierarchical recurrent neural network with attention. In: COLING (2016)"},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Xiong, W., Li, F., Cheng, M., Yu, H., Ji, D.: Bacteria biotope relation extraction via lexical chains and dependency graphs. In: BioNLP (2019)","DOI":"10.18653\/v1\/D19-5723"},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Yao, Y., et al.: DocRED: a large-scale document-level relation extraction dataset. In: ACL (2019)","DOI":"10.18653\/v1\/P19-1074"},{"key":"30_CR31","unstructured":"Zeng, D., Liu, K., Lai, S., Zhou, G., Zhao, J.: Relation classification via convolutional deep neural network. In: COLING (2014)"},{"key":"30_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Qi, P., Manning, C.D.: Graph convolution over pruned dependency trees improves relation extraction. In: EMNLP (2018)","DOI":"10.18653\/v1\/D18-1244"},{"key":"30_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhong, V., Chen, D., Angeli, G., Manning, C.D.: Position-aware attention and supervised data improve slot filling. In: EMNLP (2017)","DOI":"10.18653\/v1\/D17-1004"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75768-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,9]],"date-time":"2021-12-09T21:44:30Z","timestamp":1639086270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75768-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757670","9783030757687"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75768-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"673","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}