On Algorithm for Constructing of Decision Trees with Minimal Depth
Mikhail Moshkov, Igor Chikalov · Fundamenta Informaticae · 2000
An algorithm is considered which for a given decision table constructs a decision tree with minimal depth. The class of all information systems (finite and infinite) is described for which this algorithm has polynomial time complexity depending on the number of columns (attributes) in decision tables.