Skip to main content
Book cover

Data Mining pp 235–254Cite as

Discretization Methods

  • Chapter
  • 3915 Accesses

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Refrences

  1. Cios, K.J., Pedrycz, W., and Swiniarski, R. 1998. Data Mining Methods for Knowledge Discovery, Kluwer

    Google Scholar 

  2. Ching, J.Y., Wong, A.K.C., and Chan, K.C.C. 1995. Class-dependent discretization for inductive learning from continuous and mixed-mode data. IEEE Transactions on PAMI, 17:641–651

    Google Scholar 

  3. Cios, K.J., and Kurgan, L. 2004. CLIP4: Hybrid inductive machine learning algorithm that generates inequality rules. Information Sciences, 163(1–3): 37–83

    Article  Google Scholar 

  4. Doughherty, J., Kohavi, R., and Sahami, M. 1995. Supervised and unsupervised discretization of continuous features. In: Machine Learning: Proceedings of the 12th International Conference, Prieditis, A., and Russell S. (Eds.)

    Google Scholar 

  5. Fayyad, U.M., and Irani, K.B. 1992. On the handling of continuous-valued attributes in decision tree generation.Machine Learning, 8:87–102

    MATH  Google Scholar 

  6. Fayyad, U.M., and Irani, K.B. 1993. Multi-interval discretization of continuous-valued attributes for classification learning. In: Proceedings of the 13th Inernationa lJoint Conference on Artificial Intelligence, Morgan-Kaufmann, 1022–1027

    Google Scholar 

  7. Gama, J., Torgo, L., and Soares, C. 1998. Dynamic discretization of continuous attributes. In: Proceedings of the Sixth Ibero-American Conference on Artificial Intelligence, 160–169

    Google Scholar 

  8. Holte, R.C. 1993. Very simple classification rules perform well on most commonly used data sets. Machine Learning,11:63–90

    Article  MATH  Google Scholar 

  9. Kerber, R. 1992. Chimerge: discretization of numeric attributes. In: Proceedings of the 10th National Conference on Artificial Intelligence, MIT Press, 123–128

    Google Scholar 

  10. Kurgan, L., and Cios, K.J., 2004. CAIM discretization algorithm. IEEE Transactions on Knowledge and Data Engineering, 16(2):145–153

    Article  Google Scholar 

  11. Paterson, A., and Niblett, T.B. 1987. ACLS Manual. Edinburgh Intelligent Terminals, Ltd.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Cios, K.J., Swiniarski, R.W., Pedrycz, W., Kurgan, L.A. (2007). Discretization Methods. In: Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-36795-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-36795-8_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-33333-5

  • Online ISBN: 978-0-387-36795-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics