Consecutive Optimization of Decision Trees Concerning Various Complexity Measures

Issue title: International Conference on Soft Computing and Distributed Processing (SCDP'2002)

Article type: Research Article

Authors: Moshov, Mikhail Ju.^; | Chikalov, Igor V.

Affiliations: Intel Labs, Russian Research Center, 30, Turgenev Str., Nizhny Novgorod 603950, Russia | Faculty of Computing Mathematics and Cybernetics of Nizhny Novgorod State University 23, Gagarina Av., Nizhny Novgorod 603950, Russia

Abstract: 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.

Keywords: decision trees, complexity measures, optimization

Journal: Fundamenta Informaticae, vol. 61, no. 2, pp. 87-96, 2004