寻找令人信服的观点来支持主张

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}
引用次数: 0

摘要

最近的一些研究探讨了如何评估从数据集中提取的给定声明的强度,尤其是该声明是否可能具有误导性和偷梁换柱。我们重点研究的是对一个视图中选择图元的聚合查询的答案进行比较的声明。索赔的强度相当于这样一个问题:为支持索赔而精心选择视图的可能性有多大,而不那么精心的选择会导致相互矛盾的索赔。我们开始研究反向任务,它为批判性评估基于数据的主张提供了一个补充角度:给定一个主张,找出有用的支持观点。这项任务的目标是双重的。一方面,我们希望帮助用户找到感兴趣现象的重要证据;另一方面,我们希望为用户提供一种机制,通过提取反对声明的证据来批评或反驳给定的声明。要做到有效,支持的子群应该是重要的,并由 "自然 "的观点来定义。我们讨论了自然度的几种测量方法,并提出了在每种测量方法(以及它们的组合)下提取最佳观点的方法。主要的挑战在于计算成本,因为自然搜索是不可行的。我们设计了随时算法,主要有两个步骤:(1) 初步构建使用快速计算特征进行评估的属性组合排序列表;(2) 根据每个属性组合高效搜索实际视图。我们介绍了一项深入的实验研究,显示了我们的算法在质量和执行成本方面的有效性。我们还介绍了一项用户研究,以评估自然度测量的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Finding Convincing Views to Endorse a Claim
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信