DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
ADP007175
Title:
Improving Classification Trees with Simulated Annealing,
Corporate Author:
GEORGE MASON UNIV FAIRFAX VA
Report Date:
1992-01-01
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.
Supplementary Note:
This article is from 'Computing Science and Statistics: Proceedings of the Symposium on Interface Critical Applications of Scientific Computing (23rd): Biology, Engineering, Medicine, Speech Held in Seattle, Washington on 21-24 April 1991,' AD-A252 938, p396-402.
Pages:
0007
File Size:
0.00MB
