DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Myaeng, Sung Hyon | - |
dc.contributor.advisor | 맹성현 | - |
dc.contributor.author | Shin, Suwon | - |
dc.date.accessioned | 2023-06-26T19:31:25Z | - |
dc.date.available | 2023-06-26T19:31:25Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=997581&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/309525 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학부, 2022.2,[iv, 21 p. :] | - |
dc.description.abstract | Multi-hop question answering is a typical task of aggregating information from multiple paragraphs to find the correct answer to a given question. Existing models use graph structures to explicitly and effectively convey information between multiple paragraphs. In addition to existing models that have improved performance using graphs, we use the intuitive characteristics of graphs to improve the explainability for multi-hop question answering. Given an original model’s graph, we add necessary edges or remove unnecessary edges to construct an explainable graph. Explainable graph has less edges and paths from the question to the answer than original graph, resulting in enhancing the explainability. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | Enhancing explainability in multi-hop QA with edge addition and removal | - |
dc.title.alternative | 다중 문단 질의 응답에서 간선 추가와 제거를 통한 설명 가능성 향상 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :전산학부, | - |
dc.contributor.alternativeauthor | 신수원 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.