Accession Number : ADP007175
Title : Improving Classification Trees with Simulated Annealing,
Corporate Author : GEORGE MASON UNIV FAIRFAX VA
Personal Author(s) : Sutton, Clifton D.
Report Date : 1992
Pagination or Media Count : 7
Abstract : Classification trees produced by a recursive partitioning scheme such as CART are not guaranteed to be the best tree structured classifiers possible, partly because the sequential manner by which they are formed does not allow for looking ahead . In some cases, altering trees produced by CART by shifting the partition boundaries results in improved prediction rules. Simulated annealing can be used to efficiently search for trees which may perform better than those produced by CART.
Descriptors : *CLASSIFICATION, *COMPUTER PROGRAMS, ANNEALING, BOUNDARIES, PREDICTIONS, SHIFTING, TREES.
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE