Approximate algorithm for minimization of decision tree depth

Authors:
Mikhail J. Moshkov
Affiliations:
Faculty of Computing Mathematics and Cybernetics, Nizhny Novgorod State University, Nizhny Novgorod, Russia
Venue:
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Year:
2003

Citing 1
Cited 1

A threshold of ln n for approximating set cover (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Time complexity of decision trees

Transactions on Rough Sets III

Quantified Score

Hi-index	0.00

Visualization

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.