Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
8-2024
Abstract
An outstanding fact (OF) is a striking claim by which some entities stand out from their peers on someattribute. 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 OFless 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.
Keywords
outstanding facts, robustness measurement, perturbation analysis, knowledge graphs
Discipline
Databases and Information Systems | Graphics and Human Computer Interfaces
Research Areas
Data Science and Engineering
Publication
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2024, Barcelona, Spain, August 25-29, 2024
First Page
3539
Last Page
3550
Identifier
10.1145/3637528.3671763
Publisher
ACM
City or Country
New York
Citation
XIAO, Hanhua; LI, Yuchen; WANG, Yanhao; KARRAS, Panagiotis; MOURATIDIS, Kyriakos; and AVLONA, Natalia Rozalia.
How to avoid jumping to conclusions: Measuring the robustness of outstanding facts in knowledge graphs. (2024). Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2024, Barcelona, Spain, August 25-29, 2024. 3539-3550.
Available at: https://ink.library.smu.edu.sg/sis_research/9667
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1145/3637528.3671763
Included in
Databases and Information Systems Commons, Graphics and Human Computer Interfaces Commons