Toward computational fact-checking
Authors:
Open Access
- 1 March 2014
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 7 (7) , 589-600
Abstract
Our news are saturated with claims of "facts" made from data. Database research has in the past focused on how to answer queries, but has not devoted much attention to discerning more subtle qualities of the resulting claims, e.g., is a claim "cherry-picking"? This paper proposes a framework that models claims based on structured data as parameterized queries. A key insight is that we can learn a lot about a claim by perturbing its parameters and seeing how its conclusion changes. This framework lets us formulate practical fact-checking tasks---reverse-engineering (often intentionally) vague claims, and countering questionable claims---as computational problems. Along with the modeling framework, we develop an algorithmic framework that enables efficient instantiations of "meta" algorithms by supplying appropriate algorithmic building blocks. We present real-world examples and experiments that demonstrate the power of our model, efficiency of our algorithms, and usefulness of their results.Keywords
This publication has 20 references indexed in Scilit:
- Computing immutable regions for subspace top-k queriesProceedings of the VLDB Endowment, 2012
- Enantioselective Iridium-Catalyzed Carbonyl PropargylationSynfacts, 2012
- Computational journalismCommunications of the ACM, 2011
- The monte carlo database systemACM Transactions on Database Systems, 2011
- Probabilistic databasesCommunications of the ACM, 2009
- Identifying robust plans through plan diagram reductionProceedings of the VLDB Endowment, 2008
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Another efficient algorithm for convex hulls in two dimensionsInformation Processing Letters, 1979
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975