TL;DR
This paper introduces an unsupervised network-flow based method to assess the truthfulness of factual triples in knowledge graphs, aiding fact-checking by identifying relevant knowledge streams and patterns.
Contribution
A novel, unsupervised network-flow approach models knowledge as fluid flow to determine fact veracity and surface relevant information for fact checkers.
Findings
Outperforms existing algorithms on multiple datasets.
Effectively identifies true and false statements.
Discovers useful path patterns in knowledge graphs.
Abstract
The volume and velocity of information that gets generated online limits current journalistic practices to fact-check claims at the same rate. Computational approaches for fact checking may be the key to help mitigate the risks of massive misinformation spread. Such approaches can be designed to not only be scalable and effective at assessing veracity of dubious claims, but also to boost a human fact checker's productivity by surfacing relevant facts and patterns to aid their analysis. To this end, we present a novel, unsupervised network-flow based approach to determine the truthfulness of a statement of fact expressed in the form of a (subject, predicate, object) triple. We view a knowledge graph of background information about real-world entities as a flow network, and knowledge as a fluid, abstract commodity. We show that computational fact checking of such a triple then amounts to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
