{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T12:30:46Z","timestamp":1762000246173,"version":"build-2065373602"},"reference-count":18,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016edp7450","type":"journal-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T22:19:30Z","timestamp":1501539570000},"page":"1893-1902","source":"Crossref","is-referenced-by-count":3,"title":["Relation Extraction with Deep Reinforcement Learning"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Hongjun","family":"ZHANG","sequence":"first","affiliation":[{"name":"PLA University of Science and Technology"}]},{"given":"Yuntian","family":"FENG","sequence":"additional","affiliation":[{"name":"PLA University of Science and Technology"}]},{"given":"Wenning","family":"HAO","sequence":"additional","affiliation":[{"name":"PLA University of Science and Technology"}]},{"given":"Gang","family":"CHEN","sequence":"additional","affiliation":[{"name":"PLA University of Science and Technology"}]},{"given":"Dawei","family":"JIN","sequence":"additional","affiliation":[{"name":"PLA University of Science and Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M.T. Pazienza, \u201cInformation extraction: A multidisciplinary approach to an emerging information technology,\u201d Lecture Notes in Computer Science, vol.1299, Springer, Heidelberg, 1997. 10.1007\/3-540-63438-x","DOI":"10.1007\/3-540-63438-X"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] N. Kambhatla, \u201cCombining lexical, syntactic and semantic features with maximum entropy models for extracting relations,\u201d Proc. ACL 2004 on Interactive poster and demonstration sessions, pp.22, 2004. 10.3115\/1219044.1219066","DOI":"10.3115\/1219044.1219066"},{"key":"3","unstructured":"[3] A. Sun, R. Grishman, and S. Sekine, \u201cSemi-supervised relation extraction with large-scale word clustering,\u201d Proc. 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies-Volume 1, Association for Computational Linguistics, Portland, pp.521-529, Oregon, USA, DBLP, June 2011."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] A. Culotta and J. Sorensen, \u201cDependency tree kernels for relation extraction,\u201d Meeting of the Association for Computational Linguistics, Barcelona, Spain, DBLP, pp.423-429, July 2004. 10.3115\/1218955.1219009","DOI":"10.3115\/1218955.1219009"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] R.C. Bunescu and R.J. Mooney, \u201cA shortest path dependency kernel for relation extraction,\u201d Conference on Human Language Technology and Empirical Methods in Natural Language Processing, Association for Computational Linguistics, pp.724-731, 2005. 10.3115\/1220575.1220666","DOI":"10.3115\/1220575.1220666"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] T.-V.T. Nguyen, A. Moschitti, and G. Riccardi, \u201cConvolution kernels on constituent, dependency and sequential structures for relation extraction,\u201d Conference on Empirical Methods in Natural Language Processing, pp.1378-1387, 2009. 10.3115\/1699648.1699684","DOI":"10.3115\/1699648.1699684"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T.H. Nguyen and R. Grishman, \u201cRelation extraction: Perspective from convolutional neural networks,\u201d Proc. NAACL-HLT, pp.39-48, 2015. 10.3115\/v1\/w15-1506","DOI":"10.3115\/v1\/W15-1506"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M. Miwa and M. Bansal, \u201cEnd-to-end relation extraction using LSTMs on sequences and tree Structures,\u201d Proc. 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp.1105-1116, 2016. 10.18653\/v1\/p16-1105","DOI":"10.18653\/v1\/P16-1105"},{"key":"9","unstructured":"[9] H. Guo, \u201cGenerating text with deep reinforcement learning,\u201d Computer Science, vol.40, no.4, pp.1-5, 2015."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J. He, J. Chen, X. He, J. Gao, L. Li, L. Deng, and M. Ostendorf,\u201cDeep reinforcement learning with a natural language action space,\u201d Meeting of the Association for Computational Linguistics, pp.1621-1630, 2016. 10.18653\/v1\/p16-1153","DOI":"10.18653\/v1\/P16-1153"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] S. Hochreiter and J. Schmidhuber, \u201cLong short-term memory,\u201d Neural Computation, vol.9, no.8, pp.1735-1780, 1997. 10.1162\/neco.1997.9.8.1735","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] K.S. Tai, R. Socher, and C.D. Manning, \u201cImproved semantic representations from tree-structured long short-term memory networks,\u201d Proc. 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), vol.5, no.1, pp.1556-1566, 2015. 10.3115\/v1\/p15-1150","DOI":"10.3115\/v1\/P15-1150"},{"key":"13","unstructured":"[13] T. Tieleman and G. Hinton, \u201cLecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude,\u201d COURSERA: Neural Networks for Machine Learning, vol.4, no.2, 2012."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] J. Pennington, R. Socher, and C.D. Manning, \u201cGlove: Global Vectors for Word Representation,\u201d Conference on Empirical Methods in Natural Language Processing, no.14, pp.1532-1543, 2014. 10.3115\/v1\/d14-1162","DOI":"10.3115\/v1\/D14-1162"},{"key":"15","unstructured":"[15] G.E. Hinton, N. Srivastava, A. Krizhevsky, et al, \u201cImproving neural networks by preventing co-adaptation of feature detectors,\u201d Computer Science, vol.3, no.4, pp.212-223, 2012."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] D. Klein and C.D. Manning, \u201cAccurate unlexicalized parsing,\u201d Proc. 41st Annual Meeting on Association for Computational Linguistics-Volume 1, Association for Computational Linguistics, pp.423-430, 2003. 10.3115\/1075096.1075150","DOI":"10.3115\/1075096.1075150"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] D. Chen and C.D. Manning, \u201cA fast and accurate dependency parser using neural networks,\u201d Conference on Empirical Methods in Natural Language Processing, pp.740-750, 2014. 10.3115\/v1\/d14-1082","DOI":"10.3115\/v1\/D14-1082"},{"key":"18","unstructured":"[18] T.H. Nguyen and R. Grishman, \u201cCombining neural networks and log-linear models to improve relation extraction,\u201d Computer Science, 2015."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016EDP7450\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T17:20:59Z","timestamp":1659288059000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016EDP7450\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7450","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2017]]}}}