| Reference : Guided Inductive Logic Programming: Cleaning Knowledge Bases with Iterative User Feedback |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/10993/45625 | |||
| Guided Inductive Logic Programming: Cleaning Knowledge Bases with Iterative User Feedback | |
| English | |
| Wu, Yan [] | |
| Chen, Jinchuan [] | |
| Haxhidauti, Plarent [] | |
Ellampallil Venugopal, Vinu  [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >] | |
| Theobald, Martin [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >] | |
| 12-Mar-2020 | |
| Guided Inductive Logic Programming: Cleaning Knowledge Bases with Iterative User Feedback | |
| 92–106 | |
| Yes | |
| GCAI 2020. 6th Global Conference on Artificial Intelligence (GCAI 2020) | |
| 10-02-2020 | |
| [en] Domain-oriented knowledge bases (KBs) such as DBpedia and YAGO are largely constructed by applying a set of predefined extraction rules to the semi-structured contents
of Wikipedia articles. Although both of these large-scale KBs achieve very high average precision values (above 95% for YAGO3), subtle mistakes in a few of the underlying extraction rules may still impose a substantial amount of systematic extraction mistakes for specific relations. For example, by applying the same regular expressions to extract person names of both Asian and Western nationality, YAGO erroneously swaps most of the family and given names of Asian person entities. For traditional rule-learning approaches based on Inductive Logic Programming (ILP), it is very difficult to detect these systematic extraction mistakes, since they usually occur only in a relatively small subdomain of the relations’ arguments. In this paper, we thus propose a guided form of ILP, coined “GILP”, that iteratively asks for small amounts of user feedback over a given KB to learn a set of data-cleaning rules that (1) best match the feedback and (2) also generalize to a larger portion of facts in the KB. We propose both algorithms and respective metrics to automatically assess the quality of the learned rules with respect to the user feedback. | |
| http://hdl.handle.net/10993/45625 |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.
