Abstract
In the paper a greedy algorithm for minimization of decision tree depth is described and bounds on the algorithm precision are considered. This algorithm is applicable to data tables with both discrete and continuous variables which can have missing values. Under some natural assumptions on the class NP and on the class of considered tables, the algorithm is, apparently, close to best approximate polynomial algorithms for minimization of decision tree depth.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth & Brooks, Belmont (1984)
Feige, U.: A threshold of ln n for approximating set cover (Preliminary version). In: Proceedings of 28th Annual ACM Symposium on the Theory of Computing, pp. 314–318 (1996)
Moshkov, M.J.: Conditional tests. In: Yablonskii, S.V. (ed.) Problems of Cybernetics 40, pp. 131–170. Nauka Publishers, Moscow (1983) (in Russian)
Moshkov, M.J.: About works of R.G. Nigmatullin on approximate algorithms for solving of discrete extremal problems. Discrete Analysis and Operations Research (Series 1) 7(1), 6–17 (2000)
Moshkov, M.J.: Approximate algorithm for minimization of decision tree depth. In: Proceedings of the Ninth International Conference Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Chongqing, China. LNCS, vol. 2639, pp. 611–614. Springer, Heidelberg (2003)
Moshkov, M.J.: On minimization of decision tree depth for real data tables. In: Proceedings of the Workshop Concurrency Specification and Programming, Czarna, Poland (2003)
Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moshkov, M.J. (2004). Greedy Algorithm of Decision Tree Construction for Real Data Tables. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B., Świniarski, R.W., Szczuka, M.S. (eds) Transactions on Rough Sets I. Lecture Notes in Computer Science, vol 3100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27794-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-27794-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22374-0
Online ISBN: 978-3-540-27794-1
eBook Packages: Springer Book Archive