A Comparison of Pruning Methods for Relational Concept Learning

Pre-Pruning and Post-Pruning are two standard methods of dealing with noise in concept learning. Pre-Pruning methods are very efficient, while Post-Pruning methods typically are more accurate, but much slower, because they have to generate an overly specific concept description first. We have experimented with a variety of pruning methods, including two new methods that try to combine and integrate pre- and post-pruning in order to achieve both accuracy and efficiency. This is verified with test series in a chess position classification task.

[1]  R. Mike Cameron-Jones,et al.  FOIL: A Midterm Report , 1993, ECML.

[2]  Richard A. Lewis,et al.  Drug design by machine learning: the use of inductive logic programming to model the structure-activity relationships of trimethoprim analogues binding to dihydrofolate reductase. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[3]  S. Muggleton,et al.  Modelling the structure and function of enzymes by machine learning. , 1992, Faraday discussions.

[4]  J. Ross Quinlan,et al.  Simplifying Decision Trees , 1987, Int. J. Man Mach. Stud..

[5]  Johannes Fürnkranz,et al.  FOSSIL: A Robust Relational Learner , 1994, ECML.

[6]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[7]  Stephen Muggleton,et al.  An Experimental Comparison of Human and Machine Learning Formalisms , 1989, ML.

[8]  J. Ross Quinlan,et al.  Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .

[9]  Ivan Bratko,et al.  ASSISTANT 86: A Knowledge-Elicitation Tool for Sophisticated Users , 1987, EWSL.

[10]  Nada Lavrac,et al.  The Multi-Purpose Incremental Learning System AQ15 and Its Testing Application to Three Medical Domains , 1986, AAAI.

[11]  William W. Cohen.  Efficient Pruning Methods for Separate-and-Conquer Rule Learning Systems , 1993, IJCAI.

[12]  Stephen Muggleton.  Inductive Logic Programming: Derivations, Successes and Shortcomings , 1993, ECML.

[13]  Johannes Fürnkranz,et al.  Incremental Reduced Error Pruning , 1994, ICML.

[14]  William Frawley,et al.  Knowledge Discovery in Databases , 1991 .

[15]  Philip K. Chan,et al.  Systems for Knowledge Discovery in Databases , 1993, IEEE Trans. Knowl. Data Eng..

[16]  Donato Malerba,et al.  Decision Tree Pruning as a Search in the State Space , 1993, ECML.

[17]  Gregory Piatetsky-Shapiro,et al.  Knowledge Discovery in Databases: An Overview , 1992, AI Mag..

[18]  Johannes Fürnkranz.  Top-Down Pruning in Relational Learning , 1994, ECAI.

[19]  S. Muggleton,et al.  Protein secondary structure prediction using logic-based machine learning. , 1992, Protein engineering.

[20]  Michael J. Pazzani,et al.  An Investigation of Noise-Tolerant Relational Concept Learning Algorithms , 1991, ML.

[21]  Saso Dzeroski,et al.  Inductive Learning in Deductive Databases , 1993, IEEE Trans. Knowl. Data Eng..

[22]  Saso Dzeroski,et al.  Inductive Logic Programming: Techniques and Applications , 1993 .