Skip to main content

A Tool for Study of Optimal Decision Trees

  • Conference paper

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

Abstract

The paper describes a tool which allows us for relatively small decision tables to make consecutive optimization of decision trees relative to various complexity measures such as number of nodes, average depth, and depth, and to find parameters and the number of optimal decision trees.

The research has been partially supported by KAUST-Stanford AEA project “Predicting the stability of hydrogen bonds in protein conformations using decision-tree learning methods”.

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. Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html

  2. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth & Brooks (1984)

    Google Scholar 

  3. Chegis, I.A., Yablonskii, S.V.: Logical methods of electric circuit control. Trudy MIAN SSSR 51, 270–360 (1958) (in Russian)

    MATH  Google Scholar 

  4. Moshkov, M., Chikalov, I.: Consecutive optimization of decision trees concerning various complexity measures. Fundamenta Informaticae 61(2), 87–96 (2004)

    MATH  MathSciNet  Google Scholar 

  5. Chikalov, I., Moshkov, M., Zelentsova, M.: On optimization of decision trees. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets IV. LNCS, vol. 3700, pp. 18–36. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Nguyen, H.S.: On efficient construction of decision trees from large datasets. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 354–361. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  8. yEd Graph Editor, http://www.yworks.com/en/index.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alkhalid, A., Chikalov, I., Moshkov, M. (2010). A Tool for Study of Optimal Decision Trees. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds) Rough Set and Knowledge Technology. RSKT 2010. Lecture Notes in Computer Science(), vol 6401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16248-0_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16248-0_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16247-3

  • Online ISBN: 978-3-642-16248-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics