{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T16:23:46Z","timestamp":1775319826731,"version":"3.50.1"},"reference-count":55,"publisher":"Maximum Academic Press","issue":"4","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Current classification problems that concern data sets of large and increasing size require scalable classification algorithms. In this study, we concentrate on several scalable, linear complexity classifiers that include one of the top 10 voted data mining methods, Na\u00efve Bayes (NB), and several recently proposed semi-NB classifiers. These algorithms perform front-end discretization of the continuous features since by design they work only with nominal or discrete features. We address the lack of studies that investigate the benefits and drawbacks of discretization in the context of the subsequent classification. Our comprehensive empirical study considers 12 discretizers (two unsupervised and 10 supervised), seven classifiers (two classical NB and five semi-NB), and 16 data sets. We investigate the scalability of the discretizers and show that the fastest supervised discretizers fast class-attribute interdependency maximization (FCAIM), class-attribute interdependency maximization (CAIM), and information entropy maximization (IEM) provide discretization schemes with the highest overall quality. We show that discretization improves the classification accuracy when compared against the two classical methods, NB and Flexible Na\u00efve Bayes (FNB), executed on the raw data. The choice of the discretization algorithm impacts the significance of the improvements. The MODL, FCAIM, and CAIM methods provide statistically significant improvements, while the IEM, Class-attribute contingency coefficient (CACC), and Khiops discretizers provide moderate improvements. The most accurate classification models are generated by the Averaged one-dependence estimators (AODEsr) classifier followed by AODE and HNB (Hidden Na\u00efve Bayes). AODEsr run on data discretized with MODL, FCAIM, and CAIM provides statistically significantly better accuracies than both the classical NB methods. The worst results are obtained with the NB, FNB, and LBR (Lazy Bayes rule) classifiers. We show that although the time to build the discretization scheme could be longer than the time to train the classifier, the completion of the entire process (to discretize data, compute the classifier, and predict test instances) is often faster than the NB-based classification of the continuous instances. This is because the time to classify test instances is an important factor that is positively influenced by discretization. The biggest positive influence, both on the accuracy and the classification time, is associated with the MODL, FCAIM, and CAIM algorithms.<\/jats:p>","DOI":"10.1017\/s0269888910000329","type":"journal-article","created":{"date-parts":[[2010,11,26]],"date-time":"2010-11-26T09:30:20Z","timestamp":1290763820000},"page":"421-449","source":"Crossref","is-referenced-by-count":19,"title":["Discretization as the enabling technique for the Na\u00efve Bayes and semi-Na\u00efve Bayes-based classification"],"prefix":"10.48130","volume":"25","author":[{"given":"Marcin J.","family":"Mizianty","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Lukasz A.","family":"Kurgan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Marek R.","family":"Ogiela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2010,12,1]]},"reference":[{"key":"S0269888910000329_ref26","unstructured":"Kurgan L. A. , Cios K. J. 2001. Discretization algorithm that uses class-attribute interdependence maximization. In Proceedings of the 2001 International Conference on Artificial Intelligence, Seattle, Washington, USA, 4\u201310 August, 980\u2013987."},{"key":"S0269888910000329_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994007"},{"key":"S0269888910000329_ref47","unstructured":"Winter R. , Auerbach K. 2004. Contents under Pressure. Intelligent Enterprise. http:\/\/www.intelligententerprise.com\/showArticle.jhtml;?articleID=18902161."},{"key":"S0269888910000329_ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.852983"},{"key":"S0269888910000329_ref54","doi-asserted-by":"crossref","unstructured":"Zheng F. , Webb G. I. 2006. Efficient lazy elimination for averaged one-dependence estimators. In Proceedings of the 23rd international conference on Machine learning. ACM, 1113\u20131120.","DOI":"10.1145\/1143844.1143984"},{"key":"S0269888910000329_ref48","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"Witten","year":"2005"},{"key":"S0269888910000329_ref24","unstructured":"Kohavi R. , Sahami M. 1996. Error-based and entropy-based discretization of continuous features. In Proceedings of the 2nd International Conference Knowledge Discovery and Data Mining, Portland, Oregon, USA, 2\u20134 August, 114\u2013119."},{"key":"S0269888910000329_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2003.03.015"},{"key":"S0269888910000329_ref23","unstructured":"Kerber R. 1992. Chimerge: discretization of numeric attributes. In Proceedings of the 9th International Conference of Artificial Intelligence, Cambridge, UK, 20\u201322 February, 123\u2013128."},{"key":"S0269888910000329_ref2","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016007"},{"key":"S0269888910000329_ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-005-4258-6"},{"key":"S0269888910000329_ref8","volume-title":"Hybrid Inductive Machine Learning: An Overview of CLIP Algorithms","author":"Cios","year":"2002"},{"key":"S0269888910000329_ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2006.06.005"},{"key":"S0269888910000329_ref37","unstructured":"Mizianty M. J. , Kurgan L. A. , Ogiela M. R. 2008. Comparative analysis of the impact of discretization on the classification with na\u00efve bayes and semi-na\u00efve bayes classifiers. In ICMLA \u201908: Proceedings of the 2008 Seventh International Conference on Machine Learning and Applications, San Diego, California, USA, 11\u201313 December, 823\u2013828."},{"key":"S0269888910000329_ref20","unstructured":"John G. , Langley P. 1995. Estimating continuous distributions in bayesian classifiers. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, 338\u2013345."},{"key":"S0269888910000329_ref4","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000019804.29836.05"},{"key":"S0269888910000329_ref21","unstructured":"Kaufman K. A. , Michalski R. S. 1999. Learning from inconsistent and noisy data: the aq18 approach. In Proceedings of the 11th International Symposium Methodologies for Intelligent Systems, Saratoga Springs, NY, May 2005."},{"key":"S0269888910000329_ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"S0269888910000329_ref3","volume-title":"UCI Machine Learning Repository","author":"Asuncion","year":"2007"},{"key":"S0269888910000329_ref27","unstructured":"Kurgan L. A. , Cios K. J. 2003. Fast class-attribute interdependence maximization (CAIM) discretization algorithm. In Proceeding of International Conference on Machine Learning and Applications, Los Angeles, California, USA, 23\u201324 June, 30\u201336."},{"key":"S0269888910000329_ref34","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1109\/69.617056","article-title":"Feature selection via discretization","volume":"9","author":"Liu","year":"1997","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"S0269888910000329_ref52","unstructured":"Yang Y. , Webb G. I. 2002. A comparative study of discretization methods for naive-bayes classifiers. In Proceedings of the 2002 Pacific Rim Knowledge Acquisition Workshop, Tokyo, Japan, 18\u201319 August, 159\u2013173."},{"key":"S0269888910000329_ref50","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224183"},{"key":"S0269888910000329_ref45","doi-asserted-by":"crossref","unstructured":"Wang Z. , Webb G. I. 2002. Comparison of lazy bayesian rule and tree-augmented bayesian learning. In Proceedings of the 2002 IEEE International Conference on Data Mining, IEEE Computer Society. Washington, DC, USA, 490.","DOI":"10.1109\/ICDM.2002.1183993"},{"key":"S0269888910000329_ref41","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"S0269888910000329_ref33","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016304305535"},{"key":"S0269888910000329_ref30","unstructured":"Langley P. , Iba W. , Thompson K. 1992. An analysis of bayesian classifiers. In Proceedings of the Tenth Conference on Artificial Intelligence. MIT Press, 223\u2013228."},{"key":"S0269888910000329_ref40","volume-title":"C4.5: Programs for Machine Learning","author":"Quinlan","year":"1993"},{"key":"S0269888910000329_ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.09.004"},{"key":"S0269888910000329_ref31","doi-asserted-by":"crossref","unstructured":"Langley P. , Sage S. 1994. Induction of selective bayesian classifiers. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, 399\u2013406.","DOI":"10.1016\/B978-1-55860-332-5.50055-9"},{"key":"S0269888910000329_ref18","doi-asserted-by":"publisher","DOI":"10.1080\/03610928008827904"},{"key":"S0269888910000329_ref15","doi-asserted-by":"crossref","first-page":"525","DOI":"10.3233\/IDA-2007-11506","article-title":"Wrapper discretization by means of estimation of distribution algorithms","volume":"11","author":"Flores","year":"2007","journal-title":"Intelligent Data Analysis"},{"key":"S0269888910000329_ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007465528199"},{"key":"S0269888910000329_ref17","unstructured":"Huang W. 1996. Discretization of Continuous Attributes for Inductive Machine Learning. MSc thesis. Department of Computer Science, University of Toledo, Ohio, USA."},{"key":"S0269888910000329_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-8364-x"},{"key":"S0269888910000329_ref6","doi-asserted-by":"crossref","unstructured":"Catlett J. 1991. On changing continuous attributes into ordered discrete attributes. In EWSL \u201891: Proceedings of the European Working Session on Machine Learning. Springer-Verlag, London, UK, 164\u2013178.","DOI":"10.1007\/BFb0017012"},{"key":"S0269888910000329_ref38","unstructured":"Nemenyi P. 1963. Distribution-free Multiple Comparisons. PhD thesis, Princeton University."},{"key":"S0269888910000329_ref39","volume-title":"Acls Manual","author":"Paterson","year":"1987"},{"key":"S0269888910000329_ref25","doi-asserted-by":"crossref","unstructured":"Kujala J. , Elomaa T. 2007. Improved algorithms for univariate discretization of continuous features. In PKDD 2007: Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, 17\u201321 September, 188\u2013199.","DOI":"10.1007\/978-3-540-74976-9_20"},{"key":"S0269888910000329_ref22","unstructured":"Keogh E. J. , Pazzani M. J. 1999. Learning augmented bayesian classifiers: A comparison of distribution-based and classification-based approaches. In Proceedings of The Seventh International Workshop on Artificial Intelligence and Statistics, Fort Lauderdale, Florida, USA, 3\u20136 January, 225\u2013230."},{"key":"S0269888910000329_ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.153"},{"key":"S0269888910000329_ref14","unstructured":"Fayyad U. M. , Irani K. B. 1993. Multi-interval discretization of continuous-valued attributes for classification learning. In Proceedings of the International Joint Conference on Uncertainty in AI. Morgan Kaufmann, San Francisco, CA, USA, 1022\u20131027."},{"key":"S0269888910000329_ref1","unstructured":"Abraham R. , Simha J. B. , Iyengar S. S. 2006. A comparative analysis of discretization methods for medical datamining with na\u00efve bayesian classifier. In ICIT \u201906: Proceedings of the 9th International Conference on Information Technology. IEEE Computer Society, Washington, DC, USA, 235\u2013236."},{"key":"S0269888910000329_ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.135"},{"key":"S0269888910000329_ref19","doi-asserted-by":"crossref","unstructured":"Jiang L. , Zhang H. 2006. Weightily averaged one-dependence estimators. In Proceedings of the 9th Biennial Pacific Rim International Conference on Artificial Intelligence. Morgan Kaufmann, 970\u2013974.","DOI":"10.1007\/978-3-540-36668-3_116"},{"key":"S0269888910000329_ref11","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"Dem\u0161ar","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"S0269888910000329_ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1987.4767986"},{"key":"S0269888910000329_ref12","doi-asserted-by":"crossref","unstructured":"Dougherty J. , Kohavi R. , Sahami M. 1995. Supervised and unsupervised discretization of continuous features. In Proceedings of 12th International Conference Machine Learning. Morgan Kaufmann, 194\u2013202.","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"S0269888910000329_ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1000349"},{"key":"S0269888910000329_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116835"},{"key":"S0269888910000329_ref7","doi-asserted-by":"publisher","DOI":"10.1109\/34.391407"},{"key":"S0269888910000329_ref55","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007613203719"},{"key":"S0269888910000329_ref53","unstructured":"Zhang H. , Jiang L. , Su J. 2005. Hidden naive bayes. In Proceedings of the 20th National Conference on Artificial intelligence. AAAI Press, 919\u2013924."},{"key":"S0269888910000329_ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269594"},{"key":"S0269888910000329_ref44","doi-asserted-by":"crossref","unstructured":"Wang K. , Liu B. 1998. Concurrent discretization of multiple attributes. In Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence, Singapore, 22\u201327 November, 250\u2013259.","DOI":"10.1007\/BFb0095274"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888910000329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:43:58Z","timestamp":1767624238000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888910000329\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["S0269888910000329"],"URL":"https:\/\/doi.org\/10.1017\/s0269888910000329","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"value":"0269-8889","type":"print"},{"value":"1469-8005","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}