Abstract
This paper presents an algorithm JITTER, that aims to eliminate any unnecessary work done whilst incrementally building decision trees. In particular, we illustrate how high levels of noise can greatly affect the efficiency of induction and how a straightforward approach can ameliorate these effects.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Conroy, G. and Dutton, D. (1994), JITTER: A Lazy Machine's Guide to Induction, Technical Report, UMIST-COM-AI-94-4, Dept. of Computation, UMIST, PO BOX 88, Manchester, M60 1QD, UK.
Utgoff, P. E., (1989), Incremental Induction of Decision Trees, Machine Learning 4, ppl61–86, Kluwer Academic Publishers.
Van de Velde, W., (1990), Incremental Induction of Topologically Minimal Trees, Proceedings, 7th International Conference on Machine Learning, pp 66–74, Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Conroy, G.V., Dutton, D.M. (1995). The effects of noise on efficient incremental induction (Extended abstract). In: Lavrac, N., Wrobel, S. (eds) Machine Learning: ECML-95. ECML 1995. Lecture Notes in Computer Science, vol 912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59286-5_66
Download citation
DOI: https://doi.org/10.1007/3-540-59286-5_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59286-0
Online ISBN: 978-3-540-49232-0
eBook Packages: Springer Book Archive