Abstract
Naïve-Bayes classifiers (NB) support incremental learning. However, the lack of effective incremental discretization methods has been hindering NB’s incremental learning in face of quantitative data. This problem is further compounded by the fact that quantitative data are everywhere, from temperature readings to share prices. In this paper, we present a novel incremental discretization method for NB, incremental flexible frequency discretization (IFFD). IFFD discretizes values of a quantitative attribute into a sequence of intervals of flexible sizes. It allows online insertion and splitting operation on intervals. Theoretical analysis and experimental test are conducted to compare IFFD with alternative methods. Empirical evidence suggests that IFFD is efficient and effective. NB coupled with IFFD achieves a rapport between high learning efficiency and high classification accuracy in the context of incremental learning.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998), http://www.ics.uci.edu/mlearn/mlrepository.html
Clark, P., Niblett, T.: The CN2 induction algorithm. Machine Learning 3(4), 261–283 (1989)
Cestnik, B.: Estimating probabilities: A crucial task in machine learning. In: Proceedings of the 9th European Conference on Artificial Intelligence, p. 3, 23, pp. 147–149 (1990)
Duda, R.O., Hart, P.E.: Pattern classification and scene analysis. John Wiley and Sons, New York (1973)
Gama, J., Castillo, G.: Adaptive Bayes. In: Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence, pp. 765–774 (2002)
Gama, J., Pinto, C.: Discretization from Data Streams: Applications to Histograms and Data Mining. In: Second International Workshop on Knowledge Discovery from data Streams (2005)
John, G.H., Langley, P.: Estimating continuous distributions in Bayesian classifiers. In: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, pp. 338–345 (1995)
Langley, P., Iba, W., Thompson, K.: An analysis of Bayesian classifiers. In: Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 223–228. AAAI Press, San Jose, CA (1992)
Yang, Y., Webb, G.I.: Proportional kinterval discretization for naive-Bayes classifiers. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS (LNAI), vol. 2167, pp. 564–575. Springer, Heidelberg (2001)
Yang, Y., Webb, G.I.: Discretization For Naive-Bayes Learning: Managing Discretization Bias And Variance. Technical Report 2003/131, School of Computer Science and Software Engineering, Monash University (2003)
Yang, Y.: Discretization for Naïve-Bayes Learning. PhD thesis, school of Computer Science and Software Engineering of Monash University
Yang, Y., Webb, G.: On why discretization works for naïve-Bayes classifiers. In: Proceedings of the 16th Australian Joint Conference on Artificial Intelligence (AI) (2003)
Weiss, N.A.: Introductory Statistics, 6th edn., p. 98. Greg Tobin (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, J., Yang, Y., Webb, G.I. (2006). Incremental Discretization for Naïve-Bayes Classifier. In: Li, X., Zaïane, O.R., Li, Z. (eds) Advanced Data Mining and Applications. ADMA 2006. Lecture Notes in Computer Science(), vol 4093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811305_25
Download citation
DOI: https://doi.org/10.1007/11811305_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37025-3
Online ISBN: 978-3-540-37026-0
eBook Packages: Computer ScienceComputer Science (R0)