Shunit AgmonTechnion - Israel Institute of Technology, Amir GiladHebrew University, Brit YoungmannTechnion - Israel Institute of Technology, Shahar ZoaretsTechnion - Israel Institute of Technology, Benny KimelfeldTechnion - Israel Institute of Technology
{"title":"寻找令人信服的观点来支持主张","authors":"Shunit AgmonTechnion - Israel Institute of Technology, Amir GiladHebrew University, Brit YoungmannTechnion - Israel Institute of Technology, Shahar ZoaretsTechnion - Israel Institute of Technology, Benny KimelfeldTechnion - Israel Institute of Technology","doi":"arxiv-2408.14974","DOIUrl":null,"url":null,"abstract":"Recent studies investigated the challenge of assessing the strength of a\ngiven claim extracted from a dataset, particularly the claim's potential of\nbeing misleading and cherry-picked. We focus on claims that compare answers to\nan aggregate query posed on a view that selects tuples. The strength of a claim\namounts to the question of how likely it is that the view is carefully chosen\nto support the claim, whereas less careful choices would lead to contradictory\nclaims. We embark on the study of the reverse task that offers a complementary\nangle in the critical assessment of data-based claims: given a claim, find\nuseful supporting views. The goal of this task is twofold. On the one hand, we\naim to assist users in finding significant evidence of phenomena of interest.\nOn the other hand, we wish to provide them with machinery to criticize or\ncounter given claims by extracting evidence of opposing statements. To be effective, the supporting sub-population should be significant and\ndefined by a ``natural'' view. We discuss several measures of naturalness and\npropose ways of extracting the best views under each measure (and combinations\nthereof). The main challenge is the computational cost, as na\\\"ive search is\ninfeasible. We devise anytime algorithms that deploy two main steps: (1) a\npreliminary construction of a ranked list of attribute combinations that are\nassessed using fast-to-compute features, and (2) an efficient search for the\nactual views based on each attribute combination. We present a thorough\nexperimental study that shows the effectiveness of our algorithms in terms of\nquality and execution cost. We also present a user study to assess the\nusefulness of the naturalness measures.","PeriodicalId":501123,"journal":{"name":"arXiv - CS - Databases","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Finding Convincing Views to Endorse a Claim\",\"authors\":\"Shunit AgmonTechnion - Israel Institute of Technology, Amir GiladHebrew University, Brit YoungmannTechnion - Israel Institute of Technology, Shahar ZoaretsTechnion - Israel Institute of Technology, Benny KimelfeldTechnion - Israel Institute of Technology\",\"doi\":\"arxiv-2408.14974\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent studies investigated the challenge of assessing the strength of a\\ngiven claim extracted from a dataset, particularly the claim's potential of\\nbeing misleading and cherry-picked. We focus on claims that compare answers to\\nan aggregate query posed on a view that selects tuples. The strength of a claim\\namounts to the question of how likely it is that the view is carefully chosen\\nto support the claim, whereas less careful choices would lead to contradictory\\nclaims. We embark on the study of the reverse task that offers a complementary\\nangle in the critical assessment of data-based claims: given a claim, find\\nuseful supporting views. The goal of this task is twofold. On the one hand, we\\naim to assist users in finding significant evidence of phenomena of interest.\\nOn the other hand, we wish to provide them with machinery to criticize or\\ncounter given claims by extracting evidence of opposing statements. To be effective, the supporting sub-population should be significant and\\ndefined by a ``natural'' view. We discuss several measures of naturalness and\\npropose ways of extracting the best views under each measure (and combinations\\nthereof). The main challenge is the computational cost, as na\\\\\\\"ive search is\\ninfeasible. We devise anytime algorithms that deploy two main steps: (1) a\\npreliminary construction of a ranked list of attribute combinations that are\\nassessed using fast-to-compute features, and (2) an efficient search for the\\nactual views based on each attribute combination. We present a thorough\\nexperimental study that shows the effectiveness of our algorithms in terms of\\nquality and execution cost. We also present a user study to assess the\\nusefulness of the naturalness measures.\",\"PeriodicalId\":501123,\"journal\":{\"name\":\"arXiv - CS - Databases\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Databases\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.14974\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.14974","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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\"ive 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.