Reduced Data Sets and Entropy-Based Discretization

• Main Authors: Jerzy W. Grzymala-Busse, Zdzislaw S. Hippe, Teresa Mroczek
• Format: Article
• Language: English
• Published: MDPI AG 2019-10-01
• Series: Entropy
• Subjects: data mining; numerical attributes; discretization; entropy
• Online Access: https://www.mdpi.com/1099-4300/21/11/1051

Results of experiments on numerical data sets discretized using two methods—global versions of Equal Frequency per Interval and Equal Interval Width-are presented. Globalization of both methods is based on entropy. For discretized data sets left and right reducts were computed. For each discretized data set and two data sets, based, respectively, on left and right reducts, we applied ten-fold cross validation using the C4.5 decision tree generation system. Our main objective was to compare the quality of all three types of data sets in terms of an error rate. Additionally, we compared complexity of generated decision trees. We show that reduction of data sets may only increase the error rate and that the decision trees generated from reduced decision sets are not simpler than the decision trees generated from non-reduced data sets.