Applying Markov Logic for Debugging Probabilistic Temporal Knowledge Bases


Huber, Jakob ; Meilicke, Christian ; Stuckenschmidt, Heiner



URL: http://www.akbc.ws/2014/submissions/akbc2014_submi...
Additional URL: https://scholar.google.de/citations?view_op=view_c...
Document Type: Conference or workshop publication
Year of publication: 2014
Book title: AKBC 2014 : 4th Workshop on Automated Knowledge Base Construction (AKBC) 2014 at NIPS 2014 in Montreal, Canada, December 13, 2014
Page range: 1-6
Date of the conference: 13.12.214
Publisher: Suchanek, Fabian M.
Place of publication: New York, NY
Publishing house: ACM
Publication language: English
Institution: School of Business Informatics and Mathematics > Praktische Informatik II (Stuckenschmidt 2009-)
Subject: 004 Computer science, internet
Abstract: A probabilistic temporal knowledge base contains facts that are annotated with a time interval and a confidence score. The interval defines the time span for which it can be assumed that the fact is true with a probability that is expressed by the confidence score. Given a probabilistic temporal knowledge base, we propose the use of Markov Logic in combination with Allen’s interval calculus to select the most probable consistent subset of facts by computing the MAP state. We apply our approach on a specific domain of DBpedia, namely the domain of academics. We simulate a scenario of extending a knowledge base automatically in an open setting by adding erroneous facts to the facts stated in DBpedia. Our results in- dicate that we can eliminate a large fraction of these errors without removing too many correctly stated facts.
Additional information: Online-Ressource

Dieser Eintrag ist Teil der Universitätsbibliographie.




Metadata export


Citation


+ Search Authors in

+ Page Views

Hits per month over past year

Detailed information



You have found an error? Please let us know about your desired correction here: E-Mail


Actions (login required)

Show item Show item