A Multiple Scanning Strategy for Entropy Based Discretization

Authors:
Jerzy W. Grzymala-Busse
Affiliations:
Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, USA KS 66045 and Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland 01-237
Venue:
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Year:
2009

Citing 6
Cited 0

On the Handling of Continuous-Valued Attributes in Decision Tree Generation

Machine Learning
A new version of the rule induction system LERS

Fundamenta Informaticae
Discretization: An Enabling Technique

Data Mining and Knowledge Discovery
Handling Continuous Attributes in Discovery of Strong Decision Rules

RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Data reduction: discretization of numerical attributes

Handbook of data mining and knowledge discovery
A comparison of six approaches to discretization: a rough set perspective

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present results of experiments performed on 14 data sets with numerical attributes using a novel technique of discretization called multiple scanning. Multiple scanning is based on scanning all attributes of the data set many times, during each scan the best cut-points are found for all attributes. Results of our experiments show that multiple scanning enhances successfully, in terms of the error rate, an ordinary discretization technique based on conditional entropy.