Discrimination-based constructive induction of logic programs

作者: Boonserm Kijsirikul , Masamichi Shimura , Masayuki Numao

DOI:

关键词:

摘要: This paper presents a new approach to constructive induction, Discrimination-Based Constructive induction(DBC), which invents useful predicates in learning relations. Triggered by failure of selective DBC finds minimal set variables forming predicate that discriminates between positive and negative examples, induces definition the invented predicate. If necessary, it also subpredicates for definition. Experimental results show learns meaningful without any interactive guidance.

参考文章(10)
Giulia Pagallo, Learning DNF by decision trees international joint conference on artificial intelligence. pp. 639- 644 ,(1989)
Michael Bain, Experiments in non-monotonic learning Machine Learning Proceedings 1991. pp. 380- 384 ,(1991) , 10.1016/B978-1-55860-200-7.50078-7
Ehud Yehuda Shapiro, Algorithmic Program Debugging ,(1983)
S. Muggleton, C. Feng, Efficient Induction of Logic Programs algorithmic learning theory. pp. 368- 381 ,(1990)
Ruediger Wirth, Paul O'Rorke, Constraints on Predicate Invention Machine Learning Proceedings 1991. pp. 457- 461 ,(1991) , 10.1016/B978-1-55860-200-7.50094-5
Paul Everett Utgoff, Shift of bias for inductive concept learning Rutgers University. ,(1984)
Ryszard S. Michalski, A theory and methodology of inductive learning Computer Compacts. ,vol. 1, pp. 49- ,(1983) , 10.1016/0167-7136(83)90132-4
J.R. Quinlan, Learning Logical Definitions from Relations Machine Learning. ,vol. 5, pp. 239- 266 ,(1990) , 10.1023/A:1022699322624
Christopher John Matheus, Adding domain knowledge to SBL through feature construction national conference on artificial intelligence. pp. 803- 808 ,(1990)
STEPHEN MUGGLETON, WRAY BUNTINE, Machine invention of first order predicates by inverting resolution international conference on machine learning. pp. 339- 352 ,(1988) , 10.1016/B978-0-934613-64-4.50040-2