Classifiers in the Form of Rulesets
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.
- 16.Clark, P. & Niblett, R. (1989). The CN2 induction algorithm.Machine Learning, 3, 261–284.Google Scholar
- 70.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)Google Scholar
- 77.Quinlan, R. (1990). Learning logical definitions from relations.Machine Learning, 5, 239–266Google Scholar