@ARTICLE { Rsds2223,
author = {Moshkov, Mikhail}, 
title = {Greedy Algorithm of Decision Tree Construction for Real Data Tables}, 
journal = {Transactions on Rough Sets}, 
number = 	{(no. I)}, 
volume = 1, 
pages = {161-168}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
year = 2004, 
issn = {0302-9743}, 
isbn = {3-540-22374-6}, 
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.}, 
keywords = {data table, decision table, decision tree, depth, }, 
}