Error-Based and Entropy-Based Discretization of Continuous Features (1996)
Cached
Download Links
- [robotics.stanford.edu]
- [www-diglib.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 91 - 2 self |
BibTeX
@MISC{Kohavi96error-basedand,
author = {Ron Kohavi and Mehran Sahami},
title = {Error-Based and Entropy-Based Discretization of Continuous Features},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a comparison of error-based and entropybased methods for discretization of continuous features. Our study includes both an extensive empirical comparison as well as an analysis of scenarios where error minimization may be an inappropriate discretization criterion. We present a discretization method based on the C4.5 decision tree algorithm and compare it to an existing entropy-based discretization algorithm, which employs the Minimum Description Length Principle, and a recently proposed error-based technique. We evaluate these discretization methods with respect to C4.5 and Naive-Bayesian classifiers on datasets from the UCI repository and analyze the computational complexity of each method. Our results indicate that the entropy-based MDL heuristic outperforms error minimization on average. We then analyze the shortcomings of error-based approaches in comparison to entropy-based methods. Introduction Although real-world classification and data mining tasks often involve con...
Citations
No citations identified.
