Optimal Classification Trees

0403970 - UIVT-O 20000110 RIV DE eng C - Conference Paper (international conference)
Savický, Petr - Klaschka, Jan - Antoch, J.
Optimal Classification Trees.
COMPSTAT Proceedings in Computational Statistics. Heidelberg: PhysicaVerlag, 2000 - (Bethlehem, J.; van der Heijden, P.), s. 427-432. ISBN 3-7908-1326-5.
[COMPSTAT 2000 Symposium /14./. Utrecht (NL), 21.08.2000-25.08.2000]
R&D Projects: GA ČR GA201/00/1482; GA ČR GA201/00/0769
Institutional research plan: AV0Z1030915
Keywords : classification trees * cost-complexity measure * optimal trees * algorithms * bottom-up procedures
Subject RIV: BA - General Mathematics

Classification and regression trees have been traditionally grown by recursive partitioning,i.g. by a top-down search for "locally optimal" splits. The "local", or "one-step", optimization of splits can to some extent, using the present power of computer hardware, be substituted by the full optimization of whole trees. Two bottom-up optimization algorithms are outlined and first experimental experience is presented.
Permanent Link: http://hdl.handle.net/11104/0124254