Abstract
A discrimination net <59> can be built from a set of classified items. The set is repeatedly split into subsets by the value of a predicate, until each subset contains members of one class only. The series of splits defines the discrimination net.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Quinlan, J. R. Discovering rules by induction from large collections of examples. In Michie, D. (editor). Expert systems in the Micro-electronic Age. Edinburgh University Press, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). Classification. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive