Skip to main content

A Contribution to Decision Tree Construction Based on Rough Set Theory

  • Conference paper

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

Abstract

In this paper, the algorithm of building a decision tree is introduced by comparing the information gain or entropy. The produced process of univariate decision tree is given as an example. According to rough sets theory, the method of constructing multivariate decision tree is discussed. Using the algorithm, the complexity of decision tree is decreased, the construction of decision tree is optimized and the rule of data mining could be built.

This paper is supported by Beijing Educational Com mittee under Grant No. KM200410028013.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Han, J., Kamber, M.: Data Mining Concepts and Techniques. China Machine Press, Beijing (August 2000) (in Chinese)

    Google Scholar 

  2. Mehta, M., Agrawal, R., Rissanen, J.: SLIQ: A fast scalable classifier for data mining. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  3. Shafer, J., Agrawal, R., Mehta, M.: SPRINT: A scalable parallel classifier for data mining. In: Int. Conf. Very Large Data Bases (VLDB 1996), Bombay, India, September 1996, pp. 544–555 (1996)

    Google Scholar 

  4. Gehrke, J., Ramakrishnan, R., Ganti, V.: Rainforest: A framework for fast decision tree construction of large datasets. In: Very Large Data Bases (VLDB 1998), New York (August 1998)

    Google Scholar 

  5. Tongming, L.: Data Mining Techniques and Its Application. Beijing. Publishing House of National Defence Industry (September 2001) (in Chinese)

    Google Scholar 

  6. Duoqian, M.: Rough Sets Based on Approach for Multivariate Decision Tree Construction. Journal of Software, 425-431 (June 1997) (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, X., Huang, H., Xu, W. (2004). A Contribution to Decision Tree Construction Based on Rough Set Theory. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds) Rough Sets and Current Trends in Computing. RSCTC 2004. Lecture Notes in Computer Science(), vol 3066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25929-9_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25929-9_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22117-3

  • Online ISBN: 978-3-540-25929-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics