C4.5: programs for machine learning
C4.5: programs for machine learning
A new version of the rule induction system LERS
Fundamenta Informaticae
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
Hi-index | 0.00 |
We present results of extensive experiments performed on nine data sets with numerical attributes using six promising discretization methods. For every method and every data set 30 experiments of ten-fold cross validation were conducted and then means and sample standard deviations were computed. Our results show that for a specific data set it is essential to choose an appropriate discretization method since performance of discretization methods differ significantly. However, in general, among all of these discretization methods there is no statistically significant worst or best method. Thus, in practice, for a given data set the best discretization method should be selected individually.