Decision Expression Optimization¹

Article type: Research Article

Authors: Cockett, J.R.B.

Affiliations: Department of Computer Science, University of Tennessee, Knoxville, TN 37996-1301, U.S.A.

Note: [1] This research was supported by the U.S. Department of Energy, Office of Energy Storage and Distribution, Electric Energy Systems Program, through the Oak Ridge National Laboratory, Systems Engineering for Power Program. Activities at the University of Tennessee where supported by subcontract 37B-07685C/S13.

Abstract: A basic concern when using decision trees for the solution of taxonomic or similar problems is their efficiency. Often the information that is required to completely optimize a tree is simply not available. This is especially the case when a criterion based on probabilities is used. It is shown how it is often possible, despite the absence of this information, to improve the design of the tree. The approach is based on algebraic methods for manipulating decision trees and the identification of some particularly desirable forms.

DOI: 10.3233/FI-1987-10107

Journal: Fundamenta Informaticae, vol. 10, no. 1, pp. 93-114, 1987