Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Association rule mining-based dissolved gas analysis for fault diagnosis of power transformers
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A discretization algorithm for uncertain data
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Dynamic discreduction using Rough Sets
Applied Soft Computing
UniDis: a universal discretization technique
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove that discretization methods based on informational theoretical complexity and the methods based on statistical measures of data dependency are asymptotically equivalent. Furthermore, we define a notion of generalized entropy and prove that discretization methods based on MDLP, Gini Index, AIC, BIC, and Pearson's X2 and G2 statistics are all derivable from the generalized entropy function. We design a dynamic programming algorithm that guarantees the best discretization based on the generalized entropy notion. Furthermore, we conducted an extensive performance evaluation of our method for several publicly available data sets. Our results show that our method delivers on the average 31% less classification errors than many previously known discretization methods.