How to Avoid Jumping to Conclusions: Measuring the Robustness of Outstanding Facts in Knowledge Graphs
Hanhua Xiao, Yuchen Li, Yanhao Wang, Panagiotis Karras, Kyriakos Mouratidis, Natalia Rozalia Avlona
Abstract
An outstanding fact (OF) is a striking claim by which some entities stand out from their peers on some attribute. OFs serve data journalism, fact checking, and recommendation. However, one could jump to conclusions by selecting truthful OFs while intentionally or inadvertently ignoring lateral contexts and data that render them less striking. This jumping conclusion bias from unstable OFs may disorient the public, including voters and consumers, raising concerns about fairness and transparency in political and business competition. It is thus ethically imperative for several stakeholders to measure the robustness of OFs with respect to lateral contexts and data. Unfortunately, a capacity for such inspection of OFs mined from knowledge graphs (KGs) is missing. In this paper, we propose a methodology that inspects the robustness of OFs in KGs by perturbation analysis. We define (1) entity perturbation, which detects outlying contexts by perturbing context entities in the OF; and
(2) data perturbation, which considers plausible data that render an OF less striking. We compute the expected strikingness scores of OFs over perturbation relevance distributions and assess an OF as robust if its measured strikingness does not deviate significantly from the expected. We devise a suite of exact and sampling algorithms for perturbation analysis on large KGs. Extensive experiments reveal that our methodology accurately and efficiently detects frail OFs generated by existing mining approaches on KGs. We also show the effectiveness of our approaches through case and user studies.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a9127d4e-98a1-40ee-b3db-8bb5a010beddBuilds on7
- Inductive Entity Representations from Text via Link PredictionDaniel Daza, Michael Cochez, Paul GrothWWW 2021 · 129 citations
- On Detecting Cherry-picked TrendlinesAbolfazl Asudeh, H. V. Jagadish, You Wu, Cong YuVLDB 2020 · 32 citations
- Aggregate Queries on Knowledge Graphs: Fast Approximation with Semantic-aware SamplingYuxiang Wang, Arijit Khan, Xiaoliang Xu, Jiahui Jin et al.ICDE 2022 · 20 citations
- On Detecting Cherry-picked GeneralizationsYin Lin, Brit Youngmann, Yuval Moskovitch, H. V. Jagadish et al.VLDB 2022 · 18 citations
- Forecasting Interaction Order on Temporal GraphsWenwen Xia, Yuchen Li, Jianwei Tian, Shenghong LiKDD 2021 · 8 citations
Related papers
- Context-aware Outstanding Fact Mining from Knowledge GraphsYueji Yang, Yuchen Li, Panagiotis Karras, Anthony K. H. TungKDD 2021 · 8 citations
- Linking Surface Facts to Large-Scale Knowledge GraphsGorjan Radevski, Kiril Gashteovski, Chia-Chien Hung, Carolin Lawrence et al.EMNLP 2023 · 2 citations
- MultiHal: Multilingual Dataset for Knowledge-Graph Grounded Evaluation of LLM HallucinationsErnests Lavrinovics, Russa Biswas, Katja Hose, Johannes BjervaICML 2026 · 5 citations
- An End-To-End Re-Evaluation of Table Entity-LinkersMartin Pekár Christensen, Matteo Lissandrini, Katja HoseICDE 2026
- NewsLink: Empowering Intuitive News Search with Knowledge GraphsYueji Yang, Yuchen Li, Anthony K. H. TungICDE 2021 · 7 citations
