Number of the records: 1  

Optimal Classification Trees

  1. 1.
    SYSNO ASEP0403970
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleOptimal Classification Trees
    Author(s) Savický, Petr (UIVT-O) SAI, RID, ORCID
    Klaschka, Jan (UIVT-O) RID, SAI, ORCID
    Antoch, J. (CZ)
    Source TitleCOMPSTAT Proceedings in Computational Statistics / Bethlehem J. G. ; van der Heijden P. G. M.. - Heidelberg : PhysicaVerlag, 2000 - ISBN 3-7908-1326-5
    Pagess. 427-432
    Number of pages6 s.
    ActionCOMPSTAT 2000 Symposium /14./
    Event date21.08.2000-25.08.2000
    VEvent locationUtrecht
    CountryNL - Netherlands
    Languageeng - English
    CountryDE - Germany
    Keywordsclassification trees ; cost-complexity measure ; optimal trees ; algorithms ; bottom-up procedures
    Subject RIVBA - General Mathematics
    R&D ProjectsGA201/00/1482 GA ČR - Czech Science Foundation (CSF)
    GA201/00/0769 GA ČR - Czech Science Foundation (CSF)
    CEZ1030915
    AnnotationClassification 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.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2001

Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.