2003 | OriginalPaper | Chapter
Approximate Algorithm for Minimization of Decision Tree Depth
Author : Mikhail J. Moshkov
Published in: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 N P the considered algorithm is close to unimprovable approximate polynomial algorithms for minimization of decision tree depth.