Inductive Logic Programming Algorithm for Estimating Quality of Partial Plans

Author(s):  
Sławomir Nowaczyk ◽  
Jacek Malec
10.29007/ppgx ◽  
2020 ◽  
Author(s):  
Yan Wu ◽  
Jinchuan Chen ◽  
Plarent Haxhidauti ◽  
Vinu Ellampallil Venugopal ◽  
Martin Theobald

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 ex- traction rules may still impose a substantial amount of systematic extraction mistakes for specific relations. For example, by applying the same regular expressions to extract per- son 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.


2019 ◽  
Vol 12 (1) ◽  
pp. 89-104
Author(s):  
Yanjuan Li ◽  
Mengting Niu ◽  
Jifeng Guo

Inductive logic programming (ILP) is a hot research field in machine learning. Although ILP has obtained great success in many domains, in most ILP system, deterministic search are used to search the hypotheses space, and they are easy to trap in local optima. To overcome the shortcomings, an ILP system based on artificial bee colony (ABCILP) is proposed in this article. ABCILP adopts an ABC stochastic search to examine the hypotheses space, the shortcoming of deterministic search is conquered by stochastic search. ABCILP regard each first-order rule as a food source and propose some discrete operations to generate the neighborhood food sources. A new fitness is proposed and an adaptive strategy is adopted to determine the parameter of the new fitness. Experimental results show that: 1) the proposed new fitness function can more precisely measure the quality of hypothesis and can avoid generating an over-specific rule; 2) the performance of ABCILP is better than other systems compared with it.


1996 ◽  
Vol 9 (4) ◽  
pp. 157-206 ◽  
Author(s):  
Nada Lavrač ◽  
Irene Weber ◽  
Darko Zupanič ◽  
Dimitar Kazakov ◽  
Olga Štěpánková ◽  
...  

Author(s):  
Rinaldo Lima ◽  
Bernard Espinasse ◽  
Hilário Oliveira ◽  
Rafael Ferreira ◽  
Luciano Cabral ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document