论文信息 - Consecutive Optimization of Decision Trees Concerning Various Complexity Measures

Consecutive Optimization of Decision Trees Concerning Various Complexity Measures

In the paper algorithms are considered which allow to optimize decision trees consecutively againsts relatively different criterions. For decision tables over an arbitrary infinite restricted information system [4], these algorithms have polynomial time complexity.

Igor Chikalov | Mikhail Ju. Moshkov

[1] Igor Chikalov,et al. On Algorithm for Constructing of Decision Trees with Minimal Depth , 2000, Fundam. Informaticae.

[2] Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[3] Igor Chikalov. On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes , 2000, Rough Sets and Current Trends in Computing.