Finding Convincing Views to Endorse a Claim
Shunit Agmon, Amir Gilad, Brit Youngmann, Shahar Zoarets, Benny Kimelfeld
Abstract
Recent studies investigated the challenge of assessing the strength of a given claim extracted from a dataset, particularly the claim's potential of being misleading and cherry-picked. We focus on claims that compare answers to an aggregate query posed on a view that selects tuples. The strength of a claim amounts to the question of how likely it is that the view is carefully chosen to support the claim, whereas less careful choices would lead to contradictory claims. We embark on the study of the reverse task that offers a complementary angle in the critical assessment of data-based claims: given a claim, find useful supporting views. The goal of this task is twofold. On the one hand, we aim to assist users in finding significant evidence of phenomena of interest. On the other hand, we wish to provide them with machinery to criticize or counter given claims by extracting evidence of opposing statements.
To be effective, the supporting sub-population should be significant and defined by a "natural" view. We discuss several measures of naturalness and propose ways of extracting the best views under each measure (and combinations thereof). The main challenge is the computational cost, as naïve search is infeasible. We devise anytime algorithms that deploy two main steps: (1) a preliminary construction of a ranked list of attribute combinations that are assessed using fast-to-compute features, and (2) an efficient search for the actual views based on each attribute combination. We present a thorough experimental study that shows the effectiveness of our algorithms in terms of quality and execution cost. We also present a user study to assess the usefulness of the naturalness measures.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 33ac3ad6-204e-4a30-b5f4-5519571f63b5Cited by top-tier papers1
Ask how each one uses itBuilds on12
- Retiring Adult: New Datasets for Fair Machine LearningFrances Ding, Moritz Hardt, John Miller, Ludwig SchmidtNeurIPS 2021 · 671 citations
- Explaining Black-Box Algorithms Using Probabilistic Contrastive CounterfactualsSainyam Galhotra, Romila Pradhan, Babak SalimiSIGMOD 2021 · 85 citations
- Interpretable Data-Based Explanations for Fairness DebuggingRomila Pradhan, Jiongli Zhu, Boris Glavic, Babak SalimiSIGMOD 2022 · 53 citations
- On Detecting Cherry-picked TrendlinesAbolfazl Asudeh, H. V. Jagadish, You Wu, Cong YuVLDB 2020 · 32 citations
- Guided Exploration of Data SummariesBrit Youngmann, Sihem Amer-Yahia, Aurélien PersonnazVLDB 2022 · 22 citations
Related papers
- On Detecting Cherry-picked GeneralizationsYin Lin, Brit Youngmann, Yuval Moskovitch, H. V. Jagadish et al.VLDB 2022 · 18 citations
- On Explaining Confounding BiasBrit Youngmann, Michael J. Cafarella, Yuval Moskovitch, Babak SalimiICDE 2023 · 7 citations
- CFEVER: A Chinese Fact Extraction and VERification DatasetYing-Jia Lin, Chun-Yi Lin, Chia-Jen Yeh, Yi-Ting Li et al.AAAI 2024 · 8 citations
- A DQN-based Approach to Finding Precise Evidences for Fact VerificationHai Wan, Haicheng Chen, Jianfeng Du, Weilin Luo et al.ACL 2021
- Beyond True or False: Retrieval-Augmented Hierarchical Analysis of Nuanced ClaimsPriyanka Kargupta, Runchu Tian, Jiawei HanACL 2025
