{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T01:25:33Z","timestamp":1744161933278},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2019,9]]},"abstract":"<jats:p>We study the optimization problem of selecting numerical quantities to clean in order to fact-check claims based on such data. Oftentimes, such claims are technically correct, but they can still mislead for two reasons. First, data may contain uncertainty and errors. Second, data can be \"fished\" to advance particular positions. In practice, fact-checkers cannot afford to clean all data and must choose to clean what \"matters the most\" to checking a claim. We explore alternative definitions of what \"matters the most\": one is to ascertain claim qualities (by minimizing uncertainty in these measures), while an alternative is just to counter the claim (by maximizing the probability of finding a counterargument). We show whether the two objectives align with each other, with important implications on when fact-checkers should exercise care in selective data cleaning, to avoid potential bias introduced by their desire to counter claims. We develop efficient algorithms for solving the various variants of the optimization problem, showing significant improvements over naive solutions. The problem is particularly challenging because the objectives in the fact-checking context are complex, non-linear functions over data. We obtain results that generalize to a large class of functions, with potential applications beyond fact-checking.<\/jats:p>","DOI":"10.14778\/3358701.3358708","type":"journal-article","created":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T02:58:07Z","timestamp":1599793087000},"page":"2408-2421","source":"Crossref","is-referenced-by-count":5,"title":["Selecting data to clean for fact checking"],"prefix":"10.14778","volume":"12","author":[{"given":"Stavros","family":"Sintos","sequence":"first","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pankaj K.","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Yang","sequence":"additional","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Nonfatal injury reports. https:\/\/webappa.cdc.gov\/sasweb\/ncipc\/nfirates.html. Accessed: 2019-07-15.  Nonfatal injury reports. https:\/\/webappa.cdc.gov\/sasweb\/ncipc\/nfirates.html. Accessed: 2019-07-15."},{"key":"e_1_2_1_2_1","volume-title":"A note on \"approximation schemes for a subclass of subset selection problems\", and a faster fptas for the minimum knapsack problem. arXiv preprint arXiv:1607.07950","author":"Bentz C.","year":"2016"},{"key":"e_1_2_1_3_1","volume-title":"FiveThirtyEight","author":"Bialik C.","year":"2016"},{"key":"e_1_2_1_4_1","first-page":"1","volume-title":"VLDB","volume":"87","author":"Cavallo R.","year":"1987"},{"key":"e_1_2_1_5_1","volume-title":"Combination of opinions: The expert problem and the group consensus problem. Dissertation Abstracts International Part B: Science and Engineering[DISS. ABST. INT. PT. B- SCI. & ENG.],, 47(3)","author":"Chang K.","year":"1986"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69497-7_31"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453935"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465327"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538810"},{"issue":"4","key":"e_1_2_1_10_1","first-page":"523","article-title":"Efficient query evaluation on probabilistic databases","volume":"16","author":"Dalvi N.","year":"2007","journal-title":"PVLDB"},{"key":"e_1_2_1_11_1","first-page":"208","volume-title":"Proceedings. 45th Annual IEEE Symposium on","author":"Dean B. C.","year":"2004"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3297753.3297758"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687690"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2981768"},{"key":"e_1_2_1_15_1","volume-title":"Submodular functions and optimization","author":"Fujishige S.","year":"2005"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2566736"},{"key":"e_1_2_1_17_1","volume-title":"PolitiFact Colorado","author":"Gathright A.","year":"2016"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_19"},{"key":"e_1_2_1_19_1","volume-title":"Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM (JACM), 22(4):463--468","author":"Ibarra O. H.","year":"1975"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0857"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000045"},{"key":"e_1_2_1_22_1","volume-title":"A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM (JACM), 48(4):761--777","author":"Iwata S.","year":"2001"},{"key":"e_1_2_1_23_1","first-page":"2436","volume-title":"Advances in Neural Information Processing Systems","author":"Iyer R. K.","year":"2013"},{"key":"e_1_2_1_24_1","volume-title":"May","author":"Jackson B.","year":"2007"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797329142"},{"key":"e_1_2_1_26_1","volume-title":"Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM), 46(5):604--632","author":"Kleinberg J. M.","year":"1999"},{"key":"e_1_2_1_27_1","volume-title":"Robust submodular observation selection. Journal of Machine Learning Research, 9(Dec):2761--2801","author":"Krause A.","year":"2008"},{"key":"e_1_2_1_28_1","volume-title":"Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research, 9(Feb):235--284","author":"Krause A.","year":"2008"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994514"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-015-0116-9"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066677.1066823"},{"key":"e_1_2_1_32_1","first-page":"1999","volume-title":"Office of Justice Programs","author":"Maltz M. D."},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/ICDE.2013.6544820","volume-title":"2013 IEEE 29th International Conference on Data Engineering (ICDE)","author":"Mo L.","year":"2013"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4757-2807-1_5","volume-title":"Advances in computational and stochastic optimization, logic programming, and heuristic search","author":"Morton D. P.","year":"1998"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137631"},{"key":"e_1_2_1_37_1","unstructured":"L. Robertson. Dueling claims on crime trend. FactCheck.org July 2016.  L. Robertson. Dueling claims on crime trend. FactCheck.org July 2016."},{"key":"e_1_2_1_38_1","unstructured":"S. Sintos P. Agarwal and J. Yang. Data cleaning and fact checking: Minimizing uncertainty versus maximizing surprise. https:\/\/arxiv.org\/abs\/1909.05380.  S. Sintos P. Agarwal and J. Yang. Data cleaning and fact checking: Minimizing uncertainty versus maximizing surprise. https:\/\/arxiv.org\/abs\/1909.05380."},{"key":"e_1_2_1_39_1","first-page":"141","volume-title":"Journal of the Operational Research Society","author":"Steinberg E.","year":"1979"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/2031527"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/100783352"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610505"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732295"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996453"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3358701.3358708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:54:58Z","timestamp":1672221298000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3358701.3358708"}},"subtitle":["minimizing uncertainty vs. maximizing surprise"],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":44,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["10.14778\/3358701.3358708"],"URL":"https:\/\/doi.org\/10.14778\/3358701.3358708","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}