2000 | OriginalPaper | Buchkapitel
Optimal classification trees
verfasst von : Petr Savický, Jan Klaschka, Jaromír Antoch
Erschienen in: COMPSTAT
Verlag: Physica-Verlag HD
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Classification and regression trees have been traditionally grown by recursive partitioning, i.e. 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. In this paper, two bottom-up optimization algorithms are outlined and first experimental experience is presented.