Abstract
Some classifiers take the form of so-calledif-then rules: if the conditions from theif-part are satisfied, the example is labeled with the class specified in thethen-part. Typically, the classifier is represented not by a single rule, but by a set of rules, aruleset. The paradigm has certain advantages. For one thing, the rules capture the underlying logic, and therefore facilitate explanations of why an example has to be labeled with the given class; for another, induction of rulesets is capable of discovering recursive definitions, something that is difficult to accomplish within other machine-learning paradigms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Clark, P. & Niblett, R. (1989). The CN2 induction algorithm.Machine Learning, 3, 261–284.
Muggleton, S. & Buntine, W. (1988). Machine invention of first-order predicates by inverting resolution. InProceedings of the 5th international machine learning conference, Ann Arbor, Michigan (pp. 339–352)
Quinlan, R. (1990). Learning logical definitions from relations.Machine Learning, 5, 239–266
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Kubat, M. (2017). Classifiers in the Form of Rulesets. In: An Introduction to Machine Learning. Springer, Cham. https://doi.org/10.1007/978-3-319-63913-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-63913-0_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63912-3
Online ISBN: 978-3-319-63913-0
eBook Packages: Computer ScienceComputer Science (R0)