Skip to main content

Discretization Methods

  • Chapter
  • First Online:
Data Mining and Knowledge Discovery Handbook

Summary

Data-mining applications often involve quantitative data. However, learning from quantitative data is often less effective and less efficient than learning from qualitative data. Discretization addresses this issue by transforming quantitative data into qualitative data. This chapter presents a comprehensive introduction to discretization. It clarifies the definition of discretization. It provides a taxonomy of discretization methods together with a survey of major discretization methods. It also discusses issues that affect the design and application of discretization methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 349.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • An, A. and Cercone, N. (1999). Discretization of continuous attributes for learning classification rules. In Proceedings of the 3rd Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining, pages 509–514.

    Google Scholar 

  • Bay, S. D. (2000). Multivariate discretization of continuous variables for set mining. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 315–319.

    Google Scholar 

  • Bluman, A. G. (1992). Elementary Statistics, A Step By Step Approach. Wm.C.Brown Publishers. page5-8.

    Google Scholar 

  • Catlett, J. (1991). On changing continuous attributes into ordered discrete attributes. In Proceedings of the European Working Session on Learning, pages 164–178.

    Google Scholar 

  • Chmielewski, M. R. and Grzymala-Busse, J. W. (1996). Global discretization of continuous attributes as preprocessing for machine learning. International Journal of Approximate Reasoning, 15:319–331.

    Article  MATH  Google Scholar 

  • Dougherty, J., Kohavi, R., and Sahami, M. (1995). Supervised and unsupervised discretization of continuous features. In Proceedings of the 12th International Conference on Machine Learning, pages 194–202.

    Google Scholar 

  • Fayyad, U. M. and Irani, K. B. (1993). Multi-interval discretization of continuous-valued attributes for classification learning. In Proceedings of the 13th International Joint Conference on Artificial Intelligence, pages 1022–1027.

    Google Scholar 

  • Frank, E. andWitten, I. H. (1999). Making better use of global discretization. In Proceedings of the 16th International Conference on Machine Learning, pages 115–123. Morgan Kaufmann Publishers.

    Google Scholar 

  • Freitas, A. A. and Lavington, S. H. (1996). Speeding up knowledge discovery in large relational databases by means of a new discretization algorithm. In Advances in Databases, Proceedings of the 14th British National Conference on Databases, pages 124–133.

    Google Scholar 

  • Hsu, C.-N., Huang, H.-J., and Wong, T.-T. (2000). Why discretization works for naïve Bayesian classifiers. In Proceedings of the 17th International Conference on Machine Learning, pages 309–406.

    Google Scholar 

  • Hsu, C.-N., Huang, H.-J., and Wong, T.-T. (2003). Implications of the Dirichlet assumption for discretization of continuous variables in naive Bayesian classifiers. Machine Learning, 53(3):235–263.

    Article  MATH  Google Scholar 

  • Ishibuchi, H., Yamamoto, T., and Nakashima, T. (2001). Fuzzy Data Mining: Effect of fuzzy discretization. In The 2001 IEEE International Conference on Data Mining.

    Google Scholar 

  • Kerber, R. (1992). Chimerge: Discretization for numeric attributes. In National Conference on Artificial Intelligence, pages 123–128. AAAI Press.

    Google Scholar 

  • Kohavi, R. and Sahami, M. (1996). Error-based and entropy-based discretization of continuous features. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, pages 114–119.

    Google Scholar 

  • Macskassy, S. A., Hirsh, H., Banerjee, A., and Dayanik, A. A. (2001). Using text classifiers for numerical classification. In Proceedings of the 17th International Joint Conference on Artificial Intelligence.

    Google Scholar 

  • Mitchell, T. M. (1997). Machine Learning. McGraw-Hill Companies.

    Google Scholar 

  • Mora, L., Fortes, I., Morales, R., and Triguero, F. (2000). Dynamic discretization of continuous values from time series. In Proceedings of the 11th European Conference on Machine Learning, pages 280–291.

    Google Scholar 

  • Pazzani, M. J. (1995). An iterative improvement approach for the discretization of numeric attributes in Bayesian classifiers. In Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining, pages 228–233.

    Google Scholar 

  • Quinlan, J. R. (1986). Induction of decision trees. Machine Learning, 1:81–106.

    Google Scholar 

  • Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers.

    Google Scholar 

  • Rokach, L., Averbuch, M., and Maimon, O., Information retrieval system for medical narrative reports (pp. 217228). Lecture notes in artificial intelligence, 3055. Springer-Verlag (2004).

    Google Scholar 

  • Richeldi, M. and Rossotto, M. (1995). Class-driven statistical discretization of continuous attributes (extended abstract). In European Conference on Machine Learning, 335-338. Springer.

    Google Scholar 

  • Samuels, M. L. and Witmer, J. A. (1999). Statistics For The Life Sciences, Second Edition. Prentice-Hall. page10-11.

    Google Scholar 

  • Wu, X. (1995). Knowledge Acquisition from Databases. Ablex Publishing Corp. Chapter 6.

  • Wu, X. (1996). A Bayesian discretizer for real-valued attributes. The Computer Journal, 39(8):688–691.

    Article  Google Scholar 

  • Wu, X. (1999). Fuzzy interpretation of discretized intervals. IEEE Transactions on Fuzzy Systems, 7(6):753–759.

    Article  Google Scholar 

  • Yang, Y. (2003). Discretization for Naive-Bayes Learning. PhD thesis, School of Computer Science and Software Engineering, Monash University, Melbourne, Australia.

    Google Scholar 

  • Yang, Y. and Webb, G. I. (2001). Proportional k-interval discretization for naive-Bayes classifiers. In Proceedings of the 12th European Conference on Machine Learning, pages 564–575.

    Google Scholar 

  • Yang, Y. and Webb, G. I. (2002). Non-disjoint discretization for naive-Bayes classifiers. In Proceedings of the 19th International Conference on Machine Learning, pages 666–673.

    Google Scholar 

  • Yang, Y. and Webb, G. I. (2004). Discretization for naive-Bayes learning: Managing discretization bias and variance. Submitted for publication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ying Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Yang, Y., Webb, G.I., Wu, X. (2009). Discretization Methods. In: Maimon, O., Rokach, L. (eds) Data Mining and Knowledge Discovery Handbook. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09823-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-09823-4_6

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-09822-7

  • Online ISBN: 978-0-387-09823-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics