paper-with-me

Papers

DTCA: Decision Tree-based Co-Attention Networks for Explainable Claim Verification

2020-04-28 · ACL 2020 6 · Lianwei Wu, Yuan Rao, Yongqiang Zhao, Hao Liang, Ambreen Nazir

Recently, many methods discover effective evidence from reliable sources by appropriate neural networks for explainable claim verification, which has been widely recognized. However, in these methods, the discovery process of evidence is nontransparent and unexplained. Simultaneously, the discovered evidence only roughly aims at the interpretability of the whole sequence of claims but insufficient to focus on the false parts of claims. In this paper, we propose a Decision Tree-based Co-Attention model (DTCA) to discover evidence for explainable claim verification. Specifically, we first construct Decision Tree-based Evidence model (DTE) to select comments with high credibility as evidence in a transparent and interpretable way. Then we design Co-attention Self-attention networks (CaSa) to make the selected evidence interact with claims, which is for 1) training DTE to determine the optimal decision thresholds and obtain more powerful evidence; and 2) utilizing the evidence to find the false parts in the claim. Experiments on two public datasets, RumourEval and PHEME, demonstrate that DTCA not only provides explanations for the results of claim verification but also achieves the state-of-the-art performance, boosting the F1-score by 3.11%, 2.41%, respectively.

📄 PDF Abstract BibTeX arXiv:2004.13455

Code (0)

등록된 구현이 없습니다.

Tasks

Claim Verification

Methods 이 논문이 사용한 방법론

Interpretability 설명 없음

Similar Papers 제목 키워드 기반

ART: Adaptive Reasoning Trees for Explainable Claim Verification

2026-01-09 · Sahil Wadhwa, Himanshu Kumar, Guanqun Yang, Abbaas Alif Mohamed Nishar 외 arxiv

Large Language Models (LLMs) are powerful candidates for complex decision-making, leveraging vast encoded knowledge and remarkable zero-shot abilities. However, their adoption in high-stakes environments is hindered by t…

Decision Making

Impossibility of Depth Reduction in Explainable Clustering

2023-05-04 · Chengyuan Deng, Surya Teja Gavva, Karthik C. S., Parth Patel 외

Over the last few years Explainable Clustering has gathered a lot of attention. Dasgupta et al. [ICML'20] initiated the study of explainable k-means and k-median clustering problems where the explanation is captured by a…

Clustering

AOTree: Aspect Order Tree-based Model for Explainable Recommendation

2024-07-29 · Wenxin Zhao, Peng Zhang, Hansu Gu, Dongsheng Li 외

Recent recommender systems aim to provide not only accurate recommendations but also explanations that help users understand them better. However, most existing explainable recommendations only consider the importance of…

Decision MakingExplainable RecommendationRecommendation Systems

CDT: Cascading Decision Trees for Explainable Reinforcement Learning

2020-11-15 · Zihan Ding, Pablo Hernandez-Leal, Gavin Weiguang Ding, Changjian Li 외

Deep Reinforcement Learning (DRL) has recently achieved significant advances in various domains. However, explaining the policy of RL agents still remains an open problem due to several factors, one being the complexity …

Deep Reinforcement LearningExplainable ModelsImitation Learningreinforcement-learning+3

ExClaim: Explainable Neural Claim Verification Using Rationalization

2023-01-21 · Sai Gurrapu, Lifu Huang, Feras A. Batarseh

With the advent of deep learning, text generation language models have improved dramatically, with text at a similar level as human-written text. This can lead to rampant misinformation because content can now be created…

Claim VerificationDecision MakingExplainable Artificial Intelligence (XAI)Misinformation+1