On Decision Trees with Minimal Average Depth

  • I. Chikalov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1424)


Decision trees are studied in rough set theory [6],[7] and test theory [1], [2], [3] and are used in different areas of applications. The complexity of optimal decision tree (a decision tree with minimal average depth) construction is very high. In the paper some conditions reducing the search are formulated. If these conditions are satisfied, an optimal decision tree for the problem is a result of simple transformation of optimal decision trees for some problems, obtained by decomposition of the initial problem. The decompostion properties are used to show that bounds given in [4] are unimprovable bounds on minimal average depth of decision tree.


Decision Tree Average Depth Test Theory Diagnostic Problem Terminal Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chegis, I., Yablonskii, S.: Logical methods for electric circuit control. Trudy MIAN SSSR 51 (1958) 270–360 (in Russian).zbMATHGoogle Scholar
  2. 2.
    Moshkov, M.: Conditional tests. Problemy Cybernetici 40 (1983) 131–170 (in Russian).MathSciNetGoogle Scholar
  3. 3.
    Moshkov, M.: Decision Trees. Theory and Applications. Nizhni Novgorod University Publishers, Nizhni Novgorod (1994) (in Russian).Google Scholar
  4. 4.
    Moshkov, M., Chikalov, I.: Bounds on average weighted depth of decision trees. Fundamenta Informaticae (1997). 31 145–157zbMATHMathSciNetGoogle Scholar
  5. 5.
    Moshkov, M., Chikalov, I.: Bounds on average depth of decision trees. Proceedings of the Fifth European Congress on Intelligent Techniques and Soft Computing, Aachen (1997) 226–230Google Scholar
  6. 6.
    Pawlak, Z.: Rough Sets-Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)zbMATHGoogle Scholar
  7. 7.
    Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory. Kluwer Academic Publishers, Dordrecht (1992) 331–362Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • I. Chikalov
    • 1
  1. 1.Faculty of Calculating Mathematics and Cybernetics of Nizhni Novgorod State UniversityNizhni NovgorodRussia

Personalised recommendations