论文信息 - Pruning Methods for Rule Learning Algorithms

Pruning Methods for Rule Learning Algorithms

In this paper we will shortly review several pruning methods for rela-tional learning algorithms and show how they are related to each other. We then report some experiments in several natural domains and try to analyse the performance of the algorithms in these domains in terms of run-time and accuracy. While some algorithms are clearly faster than others, no safe recommendation for achieving high accuracy can be given.

Johannes Fürnkranz

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

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

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

[4] Johannes Fürnkranz,et al. A Comparison of Pruning Methods for Relational Concept Learning , 1994, KDD Workshop.

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

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

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

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

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

[10] Erich Mittenecker,et al. Planung und statistische Auswertung von Experimenten : eine Einführung fÜr Psychologen, Biologen und Mediziner , 1966 .

[11] M. Cameron-Jones,et al. First Order Learning, Zeroth Order Data , 1993 .

[12] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .

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

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