{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T05:17:12Z","timestamp":1717132632078},"reference-count":28,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2022,4,1]]},"DOI":"10.1587\/transinf.2021edp7154","type":"journal-article","created":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:28:32Z","timestamp":1648765712000},"page":"807-819","source":"Crossref","is-referenced-by-count":3,"title":["MKGN: A Multi-Dimensional Knowledge Enhanced Graph Network for Multi-Hop Question and Answering"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Ying","family":"ZHANG","sequence":"first","affiliation":[{"name":"Beijing Key Lab of Traffic Data Analysis and Mining, School of Computer and Information Technology, Beijing Jiaotong University"}]},{"given":"Fandong","family":"MENG","sequence":"additional","affiliation":[{"name":"Pattern Recognition Center, WeChat AI, Tecent Inc"}]},{"given":"Jinchao","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Pattern Recognition Center, WeChat AI, Tecent Inc"}]},{"given":"Yufeng","family":"CHEN","sequence":"additional","affiliation":[{"name":"Beijing Key Lab of Traffic Data Analysis and Mining, School of Computer and Information Technology, Beijing Jiaotong University"}]},{"given":"Jinan","family":"XU","sequence":"additional","affiliation":[{"name":"Beijing Key Lab of Traffic Data Analysis and Mining, School of Computer and Information Technology, Beijing Jiaotong University"}]},{"given":"Jie","family":"ZHOU","sequence":"additional","affiliation":[{"name":"Pattern Recognition Center, WeChat AI, Tecent Inc"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] P. Rajpurkar, R. Jia, and P. Liang, \u201cKnow what you don't know: Unanswerable questions for SQuAD,\u201d Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, vol.2, pp.784-789, 2018.","DOI":"10.18653\/v1\/P18-2124"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Y. Feldman and R. El-Yaniv, \u201cMulti-hop paragraph retrieval for open-domain question answering,\u201d Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Florence, Italy, pp.2296-2309, Association for Computational Linguistics, July 2019. 10.18653\/v1\/p19-1222","DOI":"10.18653\/v1\/P19-1222"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] K. Nishida, K. Nishida, M. Nagata, A. Otsuka, I. Saito, H. Asano, and J. Tomita, \u201cAnswering while summarizing: Multi-task learning for multi-hop QA with evidence extraction,\u201d Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Florence, Italy, pp.2335-2345, Association for Computational Linguistics, July 2019. 10.18653\/v1\/p19-1225","DOI":"10.18653\/v1\/P19-1225"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] N. De Cao, W. Aziz, and I. Titov, \u201cQuestion answering by reasoning across documents with graph convolutional networks,\u201d 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), Minneapolis, Minnesota, pp.2306-2317, Association for Computational Linguistics, June 2019. 10.18653\/v1\/n19-1240","DOI":"10.18653\/v1\/N19-1240"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] L. Qiu, Y. Xiao, Y. Qu, H. Zhou, L. Li, W. Zhang, and Y. Yu, \u201cDynamically fused graph network for multi-hop reasoning,\u201d Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Florence, Italy, pp.6140-6150, Association for Computational Linguistics, July 2019. 10.18653\/v1\/p19-1617","DOI":"10.18653\/v1\/P19-1617"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Ding, C. Zhou, Q. Chen, H. Yang, and J. Tang, \u201cCognitive graph for multi-hop reading comprehension at scale,\u201d Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Florence, Italy, pp.2694-2703, Association for Computational Linguistics, July 2019. 10.18653\/v1\/p19-1259","DOI":"10.18653\/v1\/P19-1259"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Y. Fang, S. Sun, Z. Gan, R. Pillai, S. Wang, and J. Liu, \u201cHierarchical graph network for multi-hop question answering,\u201d Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp.8823-8838, 2020.","DOI":"10.18653\/v1\/2020.emnlp-main.710"},{"key":"8","unstructured":"[8] F. Gao, J.C. Ni, P. Gao, Z.L. Zhou, Y.Y. Li, and H. Fujita, \u201cHeterogeneous graph attention network for multi-hop machine reading comprehension,\u201d arXiv preprint arXiv:2107.00841, 2021."},{"key":"9","unstructured":"[9] T.N. Kipf and M. Welling, \u201cSemi-supervised classification with graph convolutional networks,\u201d arXiv preprint arXiv:1609.02907, 2016."},{"key":"10","unstructured":"[10] A. Asai, K. Hashimoto, H. Hajishirzi, R. Socher, and C. Xiong, \u201cLearning to retrieve reasoning paths over wikipedia graph for question answering,\u201d arXiv preprint arXiv:1911.10470, 2019."},{"key":"11","unstructured":"[11] J. Chen, S.T. Lin, and G. Durrett, \u201cMulti-hop question answering via reasoning chains,\u201d arXiv preprint arXiv:1910.02610, 2019."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Y. Jiang and M. Bansal, \u201cSelf-assembling modular networks for interpretable multi-hop reasoning,\u201d Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pp.4474-4484, 2019.","DOI":"10.18653\/v1\/D19-1455"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] E. Perez, P. Lewis, W.-T. Yih, K. Cho, and D. Kiela, \u201cUnsupervised question decomposition for question answering,\u201d Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp.8864-8880, 2020. 10.18653\/v1\/2020.emnlp-main.713","DOI":"10.18653\/v1\/2020.emnlp-main.713"},{"key":"14","unstructured":"[14] M. Seo, A. Kembhavi, A. Farhadi, and H. Hajishirzi, \u201cBidirectional attention flow for machine comprehension,\u201d arXiv preprint arXiv:1611.01603, 2016."},{"key":"15","unstructured":"[15] J. Devlin, M.W. Chang, K. Lee, and K. Toutanova, \u201cBert: Pre-training of deep bidirectional transformers for language understanding,\u201d arXiv preprint arXiv:1810.04805, 2018."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] G. Cybenko, \u201cApproximation by superpositions of a sigmoidal function,\u201d Mathematics of control, signals and systems, vol.2, no.4, pp.303-314, 1989. 10.1007\/bf02551274","DOI":"10.1007\/BF02551274"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] L. Bauer, Y. Wang, and M. Bansal, \u201cCommonsense for generative multi-hop question answering tasks,\u201d Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, pp.4220-4230, Association for Computational Linguistics, Oct.-Nov. 2018. 10.18653\/v1\/d18-1454","DOI":"10.18653\/v1\/D18-1454"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] 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":"19","unstructured":"[19] R. Speer, J. Chin, and C. Havasi, \u201cConceptNet 5.5: An open multilingual graph of general knowledge,\u201d Thirty-first AAAI conference on artificial intelligence, pp.4444-4451, 2017."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] Y. Zhang, P. Qi, and C.D. Manning, \u201cGraph convolution over pruned dependency trees improves relation extraction,\u201d Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, pp.2205-2215, Association for Computational Linguistics, Oct.-Nov. 2018. 10.18653\/v1\/d18-1244","DOI":"10.18653\/v1\/D18-1244"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] Z. Yang, P. Qi, S. Zhang, Y. Bengio, W. Cohen, R. Salakhutdinov, and C.D. Manning, \u201cHotpotQA: A dataset for diverse, explainable multi-hop question answering,\u201d Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, pp.2369-2380, Association for Computational Linguistics, Oct.-Nov. 2018. 10.18653\/v1\/d18-1259","DOI":"10.18653\/v1\/D18-1259"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M. Tu, K. Huang, G. Wang, J. Huang, X. He, and B. Zhou, \u201cSelect, answer and explain: Interpretable multi-hop reading comprehension over multiple documents,\u201d Proceedings of the AAAI Conference on Artificial Intelligence, vol.34, no.5, pp.9073-9080, 2020. 10.1609\/aaai.v34i05.6441","DOI":"10.1609\/aaai.v34i05.6441"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] T. Alkhaldi, C. Chu, and S. Kurohashi, \u201cFlexibly focusing on supporting facts, using bridge links, and jointly training specialized modules for multi-hop question answering,\u201d IEEE\/ACM Transactions on Audio, Speech, and Language Processing, vol.29, pp.3216-3225, 2021. 10.1109\/taslp.2021.3120643","DOI":"10.1109\/TASLP.2021.3120643"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] D. Groeneveld, T. Khot, Mausam, A. Sabharwal, \u201cA simple yet strong pipeline for hotpotqa,\u201d Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp.8839-8845, 2020. 10.18653\/v1\/2020.emnlp-main.711","DOI":"10.18653\/v1\/2020.emnlp-main.711"},{"key":"25","unstructured":"[25] Y. Cao, M. Fang, and D. Tao, \u201cBag: Bi-directional attention entity graph convolutional network for multi-hop reasoning question answering,\u201d Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, vol.1, pp.357-362, 2019."},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] Y.-C. Chen and M. Bansal, \u201cFast abstractive summarization with reinforce-selected sentence rewriting,\u201d Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Melbourne, Australia, pp.675-686, Association for Computational Linguistics, July 2018. 10.18653\/v1\/p18-1063","DOI":"10.18653\/v1\/P18-1063"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] L. Weber, P. Minervini, J. M\u00fcnchmeyer, U. Leser, and T. Rockt\u00e4schel, \u201cNLProlog: Reasoning with weak unification for question answering in natural language,\u201d Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Florence, Italy, pp.6151-6161, Association for Computational Linguistics, July 2019. 10.18653\/v1\/p19-1618","DOI":"10.18653\/v1\/P19-1618"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] M. Tu, G. Wang, J. Huang, Y. Tang, X. He, and B. Zhou, \u201cMulti-hop reading comprehension across multiple documents by reasoning over heterogeneous graphs,\u201d Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Florence, Italy, pp.2704-2713, Association for Computational Linguistics, July 2019. 10.18653\/v1\/p19-1260","DOI":"10.18653\/v1\/P19-1260"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/4\/E105.D_2021EDP7154\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:05:22Z","timestamp":1648875922000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/4\/E105.D_2021EDP7154\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,1]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2021edp7154","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,1]]},"article-number":"2021EDP7154"}}