@inproceedings{e3825fa24d4d4739924428862b20ebc2,
title = "Approximate algorithm for minimization of decision tree depth",
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.",
keywords = "Data table, Decision table, Decision tree, Depth",
author = "Moshkov, {Mikhail J.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2003.; 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, RSFDGrC 2003 ; Conference date: 26-05-2003 Through 29-05-2003",
year = "2003",
doi = "10.1007/3-540-39205-x_100",
language = "English (US)",
isbn = "3540140409",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "611--614",
editor = "Guoyin Wang and Qing Liu and Yiyu Yao and Andrzej Skowron",
booktitle = "Rough Sets, Fuzzy Sets, Data Mining and Granular Computing - 9th International Conference, RSFDGrC 2003, Proceedings",
address = "Germany",
}