Skip to main content

An Algorithm for Eliminating the Inconsistencies Caused During Discretization

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4251))

  • 1241 Accesses

Abstract

Rough set based rule generation methods need discretization of the continuous values. However, most existing discretization methods cause inconsistencies. In this paper, we propose an algorithm that can eliminate the inconsistencies caused during the course of discretization. The algorithm can be integrated into the discaretization algorithms that cannot avoid causing inconsistencies to eliminate the inconsistencies. Three data experimental results show that the algorithm is available.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. Kononenko, I.: Naive Bayes classifier and continuous attributes Informatica, vol. 16, pp. 1–8 (1992)

    Google Scholar 

  3. Kononenko, I.: Inductive and Bayesian learning in medical diagnosis. Appl. Artif. Intell. 7, 317–337 (1993)

    Article  Google Scholar 

  4. Fayyad, U.M.: On the Induction of Decision Trees for Multiple Concept Learning. Ph.D. thesis, University of Michigan (1991)

    Google Scholar 

  5. Fayyad, U.M., Irani, K.: Multiinterval discretization of continuous-valued attributes for classification learning. In: Proc. of the 12th International Joint Conference on Artificial Intelligence, pp. 1022–1027 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Honghai, F., Baoyan, L., LiYun, H., Bingru, Y., Yumei, C., Shuo, Z. (2006). An Algorithm for Eliminating the Inconsistencies Caused During Discretization. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science(), vol 4251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11892960_18

Download citation

  • DOI: https://doi.org/10.1007/11892960_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46535-5

  • Online ISBN: 978-3-540-46536-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics