{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T04:00:16Z","timestamp":1773288016326,"version":"3.50.1"},"reference-count":29,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2013,4,25]],"date-time":"2013-04-25T00:00:00Z","timestamp":1366848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper we present entropy driven methodology for discretization. Recently, the original entropy based discretization was enhanced by including two options of selecting the best numerical attribute. In one option, Dominant Attribute, an attribute with the smallest conditional entropy of the concept given the attribute is selected for discretization and then the best cut point is determined. In the second option, Multiple Scanning, all attributes are scanned a number of times, and at the same time the best cut points are selected for all attributes. The results of experiments on 17 benchmark data sets, including large data sets, with 175 attributes or 25,931 cases, are presented. For comparison, the results of experiments on the same data sets using the global versions of well-known discretization methods of Equal Interval Width and Equal Frequency per Interval are also included. The entropy driven technique enhanced both of these methods by converting them into globalized methods. Results of our experiments show that the Multiple Scanning methodology is significantly better than both: Dominant Attribute and the better results of Globalized Equal Interval Width and Equal Frequency per Interval methods (using two-tailed test and 0.01 level of significance).<\/jats:p>","DOI":"10.3390\/e15051486","type":"journal-article","created":{"date-parts":[[2013,4,25]],"date-time":"2013-04-25T10:35:11Z","timestamp":1366886111000},"page":"1486-1502","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Discretization Based on Entropy and Multiple Scanning"],"prefix":"10.3390","volume":"15","author":[{"given":"Jerzy","family":"Grzymala-Busse","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, 3014 Eaton Hall, Lawrence, KS 66045, USA"},{"name":"Department of Expert Systems and Artificial Intelligence, University of Information Technology and Management, Rzeszow 35-225, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2013,4,25]]},"reference":[{"key":"ref_1","unstructured":"Blajdo, P., Grzymala-Busse, J.W., Hippe, Z.S., Knap, M., Mroczek, T., and Piatek, L. (2008, January 17-19). A Comparison of Six Approaches to Discretization\u2014A Rough Set Perspective. Proceedings of the Rough Sets and Knowledge Technology Conference, Chengdu, China."},{"key":"ref_2","unstructured":"Chan, C.C., Batur, C., and Srinivasan, A. (1991, January 13\u201316). Determination of Quantization Intervals in Rule Based Model for Dynamic. Proceedings of the IEEE Conference on Systems, Man, and Cybernetics, Charlottesvile, VA, USA."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0888-613X(96)00074-6","article-title":"Global discretization of continuous attributes as preprocessing for machine learning","volume":"15","author":"Chmielewski","year":"1996","journal-title":"Int. J. Approx. Reason."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/(SICI)1098-111X(200001)15:1<61::AID-INT4>3.0.CO;2-O","article-title":"Entropy and MDL discretization of continuous variables for Bayesian belief networks","volume":"15","author":"Clarke","year":"2000","journal-title":"Int. J. Intell. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Dougherty, J., Kohavi, R., and Sahami, M. (1995, January 9\u201312). Supervised and Unsupervised Discretization of Continuous Features. Proceedings of the 12th International Conference on Machine Learning, Lake Tahoe, CA, USA.","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1007674919412","article-title":"General and efficient multisplitting of numerical attributes","volume":"36","author":"Elomaa","year":"1999","journal-title":"Mach. Learn."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/B:DAMI.0000015868.85039.e6","article-title":"Efficient multisplitting revisited: Optima-preserving elimination of partition candidates","volume":"8","author":"Elomaa","year":"2004","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00994007","article-title":"On the handling of continuous-valued attributes in decision tree generation","volume":"8","author":"Fayyad","year":"1992","journal-title":"Mach. Learn."},{"key":"ref_9","unstructured":"Fayyad, U.M., and Irani, K.B. (3, January 28). Multi-interval Discretization of Continouus-valued Attributes for Classification Learning. Proceedings of the Thirteenth International Conference on Artificial Intelligence, Chambery, France."},{"key":"ref_10","unstructured":"Kloesgen, W., and Zytkow, J. (2002). Handbook of Data Mining and Knowledge Discovery, Oxford University Press."},{"key":"ref_11","unstructured":"Grzymala-Busse, J.W. (2009, January 14\u201317). A Multiple Scanning Strategy for Entropy Based Discretization. Proceedings of the ISMIS-09, 18th International Symposium on Methodologies for Intelligent Systems, Prague, Czech Republic."},{"key":"ref_12","first-page":"1","article-title":"Mining numerical data\u2014A rough set approach","volume":"11","year":"2010","journal-title":"Trans. Rough Sets"},{"key":"ref_13","unstructured":"Kohavi, R., and Sahami, M. (1996, January 2\u20134). Error-based and Entropy-based Discretization of Continuous Features. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, USA."},{"key":"ref_14","unstructured":"Kerber, R. (1992, January 12\u201316). ChiMerge: Discretization of Numeric Attributes. Proceedings of the 10th National Conference on AI, IEEE International Conference on Systems, Man and Cybernetics, San Jose, CA, USA."},{"key":"ref_15","first-page":"47","article-title":"Discretization techniques: A recent survey","volume":"32","author":"Kotsiantis","year":"2006","journal-title":"GESTS Int. Trans. Comput. Sci. Eng."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TKDE.2004.1269594","article-title":"CAIM discretization algorithm","volume":"16","author":"Kurgan","year":"2004","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1023\/A:1016304305535","article-title":"Discretization: An enabling technique","volume":"6","author":"Liu","year":"2002","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Polkowski, L., and Skowron, A. (1998). Rough Sets in Knowledge Discovery 1: Methodology and Applications, Physica-Verlag.","DOI":"10.1007\/978-3-7908-1883-3_1"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Stefanowski, J. (1998, January 2\u20134). Handling Continuous Attributes in Discovery of Strong Decision Rules. Proceedings of the First Conference on Rough Sets and Current Trends in Computing, Poznan-Kiekrz, Poland.","DOI":"10.1007\/3-540-69115-4_54"},{"key":"ref_20","unstructured":"Stefanowski, J. (2001). Algorithms of Decision Rule Induction in Data Mining, Poznan University of Technology Press."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1109\/TPAMI.1987.4767986","article-title":"Synthesizing statistical knowledge from incomplete mixed-mode data","volume":"9","author":"Wong","year":"1987","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_22","unstructured":"Quinlan, J.R. (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann Publishers."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","author":"Pawlak","year":"1982","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Pawlak, Z. (1991). Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers.","DOI":"10.1007\/978-94-011-3534-4"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.3233\/FI-1997-3113","article-title":"A new version of the rule induction system LERS","volume":"31","year":"1997","journal-title":"Fundam. Inform."},{"key":"ref_26","unstructured":"Grzymala-Busse, J.W. (2002, January 1\u20135). MLEM2: A New Algorithm for Rule Induction from Imperfect Data. Proceedings of the 9th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Annecy, France."},{"key":"ref_27","first-page":"189","article-title":"Financial ratios, discriminant analysis and the prediction of corporate bankruptcy","volume":"23","author":"Altman","year":"1968","journal-title":"J. Financ."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1021\/ci050135u","article-title":"Effect of selection of molecular descriptors on the prediction of blood-brain barrier penetrating and nonpenetrating agents by statistical learning methods","volume":"45","author":"Li","year":"2005","journal-title":"J. Chem. Inf. Model."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"5383","DOI":"10.1021\/ac025747h","article-title":"Empirical statistical model to estimate the accuracy of peptide identification made by MS\/MS and database search","volume":"74","author":"Keller","year":"2002","journal-title":"Anal. Chem."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/15\/5\/1486\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:46:22Z","timestamp":1760219182000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/15\/5\/1486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,25]]},"references-count":29,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2013,5]]}},"alternative-id":["e15051486"],"URL":"https:\/\/doi.org\/10.3390\/e15051486","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,25]]}}}