Optimal Classification Trees

Number of the records: 1

1.

SYSNO ASEP	0403970
Document Type	C - Proceedings Paper (int. conf.)
R&D Document Type	Conference Paper
Title	Optimal Classification Trees
Author(s)	Savický, Petr (UIVT-O)_{SAI, RID, ORCID} Klaschka, Jan (UIVT-O)_{RID, SAI, ORCID} Antoch, J. (CZ)
Source Title	COMPSTAT Proceedings in Computational Statistics / Bethlehem J. G. ; van der Heijden P. G. M.. - Heidelberg : PhysicaVerlag, 2000 - ISBN 3-7908-1326-5
Pages	s. 427-432
Number of pages	6 s.
Action	COMPSTAT 2000 Symposium /14./
Event date	21.08.2000-25.08.2000
VEvent location	Utrecht
Country	NL - Netherlands
Language	eng - English
Country	DE - Germany
Keywords	classification trees ; cost-complexity measure ; optimal trees ; algorithms ; bottom-up procedures
Subject RIV	BA - General Mathematics
R&D Projects	GA201/00/1482 GA ČR - Czech Science Foundation (CSF)
	GA201/00/0769 GA ČR - Czech Science Foundation (CSF)
CEZ	1030915
Annotation	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.
Workplace	Institute of Computer Science
Contact	Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
Year of Publishing	2001

Number of the records: 1