Abstract
An algorithm for learning ripple down rules, that is rules with hierarchical exceptions, is presented. The algorithm is generic with respect to the set of possible conditions; conditions are manipulated by an abstract generalization operator only. A specialization of the algorithm is shown that learns classification rules in real-valued attribute space; it is compared to other machine learning, neural network, and statistical algorithms. Learning algorithms for graphs or first order logics can be derived as well.
Preview
Unable to display preview. Download preview PDF.
References
J. Cendrowska. An algorithm for inducing modular rules. International Journal for Man-Machine Studies, pages 349–370, 1987.
P. Clark and T. Niblett. The cn2 induction algorithm. Machine Learning, 3:261–283, 1989.
P. Compton and R. Jansen. Knowledge in context: a strategy for expert system maintainance. In Proceedings of the 2nd Australian Joint Artificial Intelligence Conference, volume 406 of LNAI, pages 292–306, Adelaide, 1988. Springer.
Y. Dimopoulos and A. Kakas. Learning non-monotonic logic programs: Learning exceptions. In N. Lavrac and S. Wrobel, editors, Machine Learning: ECML-95 (Proc. European Conf. on Machine Learning, 1995), Lecture Notes in Artificial Intelligence 912, pages 122–137, Berlin, Heidelberg, New York, 1995. Springer Verlag.
B. R. Gaines and P. J. Compton. Induction of ripple down rules. 5th Australian Conference on Artificial Intelligence, pages 349–355, 1992.
R. M. Goodman and P. Smyth. The induction of probabilistic rule sets — the itrule algorithm. In B. Spatz, editor, Proceedings of the Sixth International Workshop on Machine Learning, pages 129–132, San Mateo, 1989. CA: Morgan Kaufmann.
D. Helmbold, R. Sloan, and M. K. Warmuth. Learning nested differences of intersection-closed concept classes. Proceedings of the Workshop on Computational Learning Theory, pages 41–56, 1989.
J. Kivinen, H. Mannila, and E. Ukkonen. Learning hierarchical rule sets. Proceedings of the ACM Workshop of Computational Learning Theory, 1993.
R. S. Michalski. Pattern recognition as rule-guided inductive inference. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2(4):349–361, July 1980.
D. Michie. Problems of computer aided concept formation. In J. R. Quinlan, editor, Applications of Expert Systems, volume 2, pages 310–333, 1989.
D. Michie, D. J. Spiegelhalter, and C. C. Taylor. Machine Learning, Neural and Statistical Classification. Ellis Horwood, 1994.
S. Muggleton. Inductive Logic Programming. Volume 38 of A.P.I.C. series. Academic Press Ltd., London, 1992.
J. R. Quinlan. Induction of decision trees. Machine Learning, 1(1), 1986.
R. L. Rivest. Learning decision lists. Machine Learning, 2(2):229–246, 1987.
T. Scheffer. Induktion hierarchischer Regelsysteme. Master's thesis, Technische Universität Berlin, 1995.
S. Unger and F. Wysotzki. Lernfähige Klassifizierungssysteme. Akademie Verlag Berlin, 1981.
S. A. Vere. Multilevel counterfactuals for generalizations of relational concepts and productions. Artificial Intelligence, 14:139–164, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scheffer, T. (1995). A generic algorithm for learning rules with hierarchical exceptions. In: Wainer, J., Carvalho, A. (eds) Advances in Artificial Intelligence. SBIA 1995. Lecture Notes in Computer Science, vol 991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034811
Download citation
DOI: https://doi.org/10.1007/BFb0034811
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60436-5
Online ISBN: 978-3-540-47467-8
eBook Packages: Springer Book Archive