Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 3

The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.

Computing and Maintaining Provenance of Query Result Probabilities in Uncertain Knowledge Graphs

Gaur, Garima, Dang, Abhishek, Bhattacharya, Arnab, Bedathur, Srikanta·2021·Proceedings of the 30th ACM International Conference on Information & Knowledge Management
DOI 10.1145/3459637.3482330
Open this paper in CoChat — free account

Abstract

Knowledge graphs (KG) model relationships between entities as labeled edges (or facts). They are mostly constructed using a suite of automated extractors, thereby inherently leading to uncertainty in the extracted facts. Modeling the uncertainty as probabilistic confidence scores results in a probabilistic knowledge graph. Graph queries over such probabilistic KGs require answer computation along with the computation of result probabilities, i.e., probabilistic inference. We propose a system, HAPPI (How Provenance of Probabilistic Inference), to handle such query processing and inference. Complying with the standard provenance semiring model, we propose a novel commutative semiring to symbolically compute the probability of the result of a query. These provenance-polynomial-like symbolic expressions encode fine-grained information about the probability computation process. We leverage this encoding to efficiently compute as well as maintain probabilities of results even as the underlying KG changes. Focusing on conjunctive basic graph pattern queries, we observe that HAPPI is more efficient than knowledge compilation for answering commonly occurring queries with lower range of probability derivation complexity. We propose an adaptive system that leverages the strengths of both HAPPI and compilation based techniques, for not only to perform efficient probabilistic inference and compute their provenance, but also to incrementally maintain them.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3459637.3482330

Cites

42 of 42 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 10

  1. 10.5555/1182635.1164231 · doi:10.5555/1182635.1164231
  2. 10.5555/645504.656274 · doi:10.5555/645504.656274
  3. 10.5555/645914.671645 · doi:10.5555/645914.671645
  4. 10.5555/3000001.3000069 · doi:10.5555/3000001.3000069
  5. 10.5555/3164891 · doi:10.5555/3164891
  6. 10.5555/1325851.1326038 · doi:10.5555/1325851.1326038
  7. Anthony Fader , Stephen Soderland , and Oren Etzioni . 2011. Identifying Relations for Open Information Extraction . Association for Computational Linguistics (ACL) . Anthony Fader, Stephen Soderland, and Oren Etzioni. 2011. Identifying Relations for Open Information Extraction. Association for Computational Linguistics (ACL).
  8. Garima Gaur Abhishek Dang Arnab Bhattacharya and Srikanta Bedathur. 2021. Computing and Maintaining Provenance of Query Result Probabilities in Uncertain Knowledge Graphs. arxiv: 2108.07758 [cs.DB] Garima Gaur Abhishek Dang Arnab Bhattacharya and Srikanta Bedathur. 2021. Computing and Maintaining Provenance of Query Result Probabilities in Uncertain Knowledge Graphs. arxiv: 2108.07758 [cs.DB] · arXiv
  9. 10.5555/3171642.3171738 · doi:10.5555/3171642.3171738
  10. 10.5555/2886521.2886641 · doi:10.5555/2886521.2886641

Metadata

Authors
Gaur, G., Dang, A., Bhattacharya, A., & Bedathur, S.
Venue
Proceedings of the 30th ACM International Conference on Information & Knowledge Management
Publisher
ACM
Published
2021-10-26
Pages
545-554
DOI
10.1145/3459637.3482330
Cited by
3
References
42
Licence
www.acm.org/publications/policies/copyright_policy#Background (vor)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.