Towards Probabilistic Bitemporal Knowledge Graphs

5Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The emergence of open information extraction as a tool for constructing and expanding knowledge graphs has aided the growth of temporal data, for instance, YAGO, NELL and Wikidata. While YAGO and Wikidata maintain the valid time of facts, NELL records the time point at which a fact is retrieved from some Web corpora. Collectively, these knowledge graphs (KGs) store facts extracted from Wikipedia and other sources. Due to the imprecise nature of the extraction tools that are used to build and expand KGs, such as NELL, the facts in the KGs are weighted (a confidence value representing the correctness of a fact). Additionally, NELL can be considered as a transaction time KG because every fact is associated with extraction date. On the other hand, YAGO and Wikidata use the valid time model because they only maintain facts together with their validity time (temporal scope). In this paper, we propose a bitemporal model (that combines transaction and valid time models) for maintaining and querying probabilistic temporal knowledge graphs. We report our evaluation results of the proposed approach.

Cite

CITATION STYLE

APA

Chekol, M. W., & Stuckenschmidt, H. (2018). Towards Probabilistic Bitemporal Knowledge Graphs. In The Web Conference 2018 - Companion of the World Wide Web Conference, WWW 2018 (pp. 1757–1762). Association for Computing Machinery, Inc. https://doi.org/10.1145/3184558.3191637

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free