@INPROCEEDINGS { Rsds2584,
author = {Moshkov, Mikhail}, 
title = {Approximate Algorithm for Minimization of Decision Tree Depth}, 
booktitle = {Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing}, 
series =  = {Lecture Notes in Artificial Intelligence}, 
volume = 2639, 
pages = {611--614}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
month = {May}, 
year = 2003, 
editor = {Wang, Guoying and Liu, Quing and Yao, Yiyu and Skowron, Andrzej}, 
issn = {0302-9743}, 
isbn = {3-540-14040-9}, 
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 adapted for application to data tables with both discrete and continuous variables, which can have missing values. To this end we transform given data table into a decision table. Under some natural assumption on the class $NP$ the considered algorithm is close to unimprovable approximate polynomial algorithms for minimization of decision tree depth.}, 
keywords = {data table, decision table, decision tree, depth, }, 
}