Supervised and unsupervised discretization of continuous features¶
Dougherty, J., Kohavi, & Sahami, M. (1995). Supervised and unsupervised discretization of continuous features. Proceedings of the Twelfth International Conference on Machine Learning.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Segmentation and Boundary Drawing
- Data Science: Feature discretization and binning transform continuous variables (age 0-100) into categorical bins (child, teen, adult, senior); the boundaries encode domain knowledge about life stages, with Dougherty, Kohavi, and Sahami (1995) systematically comparing equal-width, equal-frequency, and entropy-based discretization methods on classifier accuracy.
This sourceMorgan Kaufmann. Comparative study of equal-width, equal-frequency, and entropy-based discretization methods for continuous features in classifier pipelines.
- Data Science: Feature discretization and binning transform continuous variables (age 0-100) into categorical bins (child, teen, adult, senior); the boundaries encode domain knowledge about life stages, with Dougherty, Kohavi, and Sahami (1995) systematically comparing equal-width, equal-frequency, and entropy-based discretization methods on classifier accuracy.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:6018e0b5fa35 · see in the full table