Advertisement

Algorithms for constructing of decision trees

  • Mikhail Moshkov
Poster Session 6
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1263)

Abstract

Decision trees are widely used in different applications for problem solving and for knowledge representation. In the paper algorithms for decision tree constructing with bounds on complexity and precision are considered. In these algorithms different measures for time complexity of decision trees and different measures for uncertainty of decision tables are used. New results about precision of polynomial approximate algorithms for covering problem solving [1, 2] show that some of considered algorithms for decision tree constructing are, apparently, close to unimprovable.

References

  1. 1.
    Feige, U.: A threshold of In n for approximating set cover (Preliminary version). Proceedings of 28th Annual ACM Symposium on the Theory of Computing (1996) 314–318Google Scholar
  2. 2.
    Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 45(5) (1994) 960–981CrossRefGoogle Scholar
  3. 3.
    Moshkov, M.Ju.: On conditional tests. Dokl. Akad. Nauk SSSR 265 (1982) 550–552 (in Russian)Google Scholar
  4. 4.
    Moshkov, M.Ju.: Conditional tests. Edited by S.V. Yablonskii. Problemy Cyber-neticy 40. Nauka Publishers, Moscow (1983) 131–170 (in Russian)Google Scholar
  5. 5.
    Moshkov, M.Ju.: Decision Trees. Theory and Applications. Nizhni Novgorod University Publishers, Nizhni Novgorod (1994) (in Russian)Google Scholar
  6. 6.
    Moshkov, M.Ju.: Complexity of decision trees for regular language word recognition. Preproceedings of the Second International Conference Developments in Language Theory. Magdeburg, Germany (1995)Google Scholar
  7. 7.
    Moshkov, M.Ju.: On the depth of decision trees over infinite information systems. Proceedings of the Congress “Information Processing and Management of Uncertainty in Knowledge-Based Systems”. Granada, Spain (1996) 885–886Google Scholar
  8. 8.
    Moshkov, M.Ju.: On global Shannon functions of two-valued information systems. Proceedings of the Fourth International Workshop on Rough Sets, Fuzzy Sets and Machine Discovery. Tokyo, Japan (1996) 142–143Google Scholar
  9. 9.
    Moshkov, M.Ju.: Diagnosis of constant faults of circuits. Proceedings of the Fourth International Workshop on Rough Sets, Fuzzy Sets and Machine Discovery. Tokyo, Japan (1996) 325–327Google Scholar
  10. 10.
    Quinlan, J.R.: Discovering rules by induction from large collections of examples. Experts Systems in the Microelectronic Age. Edited by D. Michie. Edinburg University Press (1979)Google Scholar
  11. 11.
    Quinlan, J.R.: Induction of decision trees. Machine Learning 1 (1986) 81–106Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Mikhail Moshkov
    • 1
  1. 1.Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University 10Nizhni NovgorodRussia

Personalised recommendations