Advertisement

On Optimization of Decision Trees

  • Igor V. Chikalov
  • Mikhail Ju. Moshkov
  • Maria S. Zelentsova
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3700)

Abstract

In the paper algorithms are considered which allow to consecutively optimize decision trees for decision tables with many-valued decisions relatively different complexity measures such as number of nodes, weighted depth, average weighted depth, etc. For decision tables over an arbitrary infinite restricted information system [5] these algorithms have (at least for the three mentioned measures) polynomial time complexity depending on the length of table description. For decision tables over one of such information systems experimental results of decision tree optimization are described.

Keywords

Decision trees complexity measures optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chikalov, I.V.: Algorithm for constructing of decision trees with minimal number of nodes. In: Proceedings of the Second International Conference on Rough Sets and Current Trends in Computing, Banff, Canada, pp. 107–111 (2000)Google Scholar
  2. 2.
    Chikalov, I.V.: Algorithm for constructing of decision trees with minimal average depth. In: Proceedings of the Eighth International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems, Madrid, Spain, vol. 1, pp. 376–379 (2000)Google Scholar
  3. 3.
    Chlebus, B.S., Nguyen, S.H.: On finding optimal discretizations for two attributes. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 537–544. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  4. 4.
    Moshkov, M.J., Chikalov, I.V.: On effective algorithms for construction of decision trees. In: Proceedings of the Twelfth International Conference Problems of Theoretical Cybernetics, Part 2. Nizhny Novgorod, Russia, p. 165 (1999) (in Russian)Google Scholar
  5. 5.
    Moshkov, M.J., Chikalov, I.V.: On algorithm for constructing of decision trees with minimal depth. Fundamenta Informaticae 41(3), 295–299 (2000)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Moshkov, M.J., Chikalov, I.V.: Consecutive optimization of decision trees concerning various complexity measures. Fundamenta Informaticae 61(2), 87–96 (2004)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)zbMATHGoogle Scholar
  8. 8.
    Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Igor V. Chikalov
    • 1
  • Mikhail Ju. Moshkov
    • 2
  • Maria S. Zelentsova
    • 3
  1. 1.Intel LabsRussian Research CenterNizhny NovgorodRussia
  2. 2.Institute of Computer ScienceUniversity of SilesiaSosnowiecPoland
  3. 3.Faculty of Computing Mathematics and Cybernetics of NizhnyNovgorod State UniversityNizhny NovgorodRussia

Personalised recommendations