Discretisation in Lazy Learning Algorithms

  title={Discretisation in Lazy Learning Algorithms},
  author={Kai Ming Ting},
  journal={Artificial Intelligence Review},
This paper adopts the idea of discretising continuous attributes (Fayyad and Irani 1993) and applies it to lazy learning algorithms (Aha 1990; Aha, Kibler and Albert 1991). This approach converts continuous attributes into nominal attributes at the outset. We investigate the effects of this approach on the performance of lazy learning algorithms and examine it empirically using both real-world and artificial data to characterise the benefits of discretisation in lazy learning algorithms… CONTINUE READING
11 Citations
18 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 18 references

A Study of Distance-Based Machine Learning Algorithms

  • D. Wettschereck
  • PhD Thesis,
  • 1994
Highly Influential
5 Excerpts

Common Issues in Instance-Based and Naive Bayesian Classifiers

  • K. M. Ting
  • PhD Thesis,
  • 1995
2 Excerpts

Comparing Connectionist and Symbolic Learning Methods

  • J. R. Quinlan
  • Computational Learning Theory and Natural…
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…