{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:29:08Z","timestamp":1774909748837,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2020AAA0106100"],"award-info":[{"award-number":["2020AAA0106100"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176145"],"award-info":[{"award-number":["62176145"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Audio Speech Lang. Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/taslp.2024.3434469","type":"journal-article","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T17:44:05Z","timestamp":1722015845000},"page":"3759-3770","source":"Crossref","is-referenced-by-count":1,"title":["Heterogeneous-Graph Reasoning With Context Paraphrase for Commonsense Question Answering"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9678-3489","authenticated-orcid":false,"given":"Yujie","family":"Wang","sequence":"first","affiliation":[{"name":"Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0912-4870","authenticated-orcid":false,"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5887-9327","authenticated-orcid":false,"given":"Jiye","family":"Liang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1545-5553","authenticated-orcid":false,"given":"Ru","family":"Li","sequence":"additional","affiliation":[{"name":"Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, School of Computer and Information Technology, Shanxi University, Taiyuan, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1810.04805"},{"key":"ref2","article-title":"RoBERTa: A robustly optimized BERT pretraining approach","author":"Liu","year":"2019"},{"key":"ref3","first-page":"1","article-title":"ALBERT: A lite BERT for self-supervised learning of language representations","volume-title":"Proc. 8th Int. Conf. Learn Representations","author":"Lan","year":"2020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/taslp.2021.3124365"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1454"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1332"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6239"},{"key":"ref8","first-page":"4149","article-title":"CommonsenseQA: A question answering challenge targeting commonsense knowledge","volume-title":"Proc. 2019 Conf. North Amer. Chapter Assoc. Comput. Linguistics, Hum. Lang. Technol.","volume":"1","author":"Talmor","year":"2019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013027"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.11164"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1282"},{"key":"ref13","first-page":"1295","article-title":"Scalable multi-hop relational reasoning for knowledge-aware question answering","volume-title":"Proc. Conf. Empir. Methods Natural Lang. Process.","author":"Feng","year":"2020"},{"key":"ref14","first-page":"535","article-title":"QA-GNN: Reasoning with language models and knowledge graphs for question answering","volume-title":"2021 Conf. North Amer. Chapter Assoc. Comput. Linguistics, Hum. Lang. Technol.","author":"Yasunaga","year":"2021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.naacl-main.372"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref17","article-title":"KeyBERT: Minimal keyword extraction with BERT","author":"Grootendorst","year":"2020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"ref19","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.295"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-main.222"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6364"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-main.232"},{"key":"ref24","first-page":"1201","article-title":"Fusing context into knowledge graph for commonsense reasoning","volume-title":"Proc. Findings Assoc. Comput. Linguistics, ACL-IJCNLP 2021","author":"Xu","year":"2020"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/d19-1410"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5681"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"7187","DOI":"10.18653\/v1\/2020.emnlp-main.583","article-title":"Is graph structure necessary for multi-hop question answering?","volume-title":"2020 Conf. Empirical Methods Natural Lang. Process.","author":"Shao","year":"2020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1260"},{"key":"ref29","first-page":"1","article-title":"Decoupled weight decay regularization","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Loshchilov"},{"key":"ref30","first-page":"4967","article-title":"A simple neural network module for relational reasoning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Santoro","year":"2017"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017208"},{"key":"ref33","first-page":"1","article-title":"GreaseLM: Graph reasoning enhanced language models for question answering","volume-title":"Proc. 10th Int. Conf. Learn. Representations","author":"Zhang","year":"2022"},{"key":"ref34","first-page":"1","article-title":"FreeLB: Enhanced adversarial training for natural language understanding","volume-title":"Proc. 8th Int. Conf. Learn Representations","author":"Zhu","year":"2020"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-6003"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"4129","DOI":"10.18653\/v1\/2020.findings-emnlp.369","article-title":"Connecting the dots: A knowledgeable path generator for commonsense question answering","volume-title":"Proc. Findings Assoc. Comput. Linguistics, EMNLP 2020","author":"Wang","year":"2020"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v41i4.5304"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1615"},{"key":"ref39","article-title":"Knowledge fusion and semantic knowledge ranking for open domain question answering","author":"Banerjee","year":"2020"},{"key":"ref40","first-page":"1","article-title":"Exploring the limits of transfer learning with a unified text-to-text transformer","volume":"21","author":"Raffel","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","doi-asserted-by":"crossref","first-page":"1896","DOI":"10.18653\/v1\/2020.findings-emnlp.171","article-title":"Unifiedqa: Crossing format boundaries with a single QA system","volume-title":"Proc. Findings Assoc. Comput. Linguistics, EMNLP 2020","author":"Khashabi","year":"2020"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/p19-1472"},{"key":"ref43","article-title":"Llama 2: Open foundation and fine-tuned chat models","volume":"2023","author":"Touvron"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3560815"},{"key":"ref45","first-page":"1","article-title":"Towards a unified view of parameter-efficient transfer learning","volume-title":"Proc. 10th Int. Conf. Learn. Representations","author":"He","year":"2022"}],"container-title":["IEEE\/ACM Transactions on Audio, Speech, and Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6570655\/10304349\/10612243.pdf?arnumber=10612243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T04:20:55Z","timestamp":1723868455000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10612243\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/taslp.2024.3434469","relation":{},"ISSN":["2329-9290","2329-9304"],"issn-type":[{"value":"2329-9290","type":"print"},{"value":"2329-9304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}