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.
Chapter PDF
Similar content being viewed by others
References
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–318
Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 45(5) (1994) 960–981
Moshkov, M.Ju.: On conditional tests. Dokl. Akad. Nauk SSSR 265 (1982) 550–552 (in Russian)
Moshkov, M.Ju.: Conditional tests. Edited by S.V. Yablonskii. Problemy Cyber-neticy 40. Nauka Publishers, Moscow (1983) 131–170 (in Russian)
Moshkov, M.Ju.: Decision Trees. Theory and Applications. Nizhni Novgorod University Publishers, Nizhni Novgorod (1994) (in Russian)
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)
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–886
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–143
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–327
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)
Quinlan, J.R.: Induction of decision trees. Machine Learning 1 (1986) 81–106
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moshkov, M. (1997). Algorithms for constructing of decision trees. In: Komorowski, J., Zytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1997. Lecture Notes in Computer Science, vol 1263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63223-9_132
Download citation
DOI: https://doi.org/10.1007/3-540-63223-9_132
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63223-8
Online ISBN: 978-3-540-69236-2
eBook Packages: Springer Book Archive