29 March 1988 Stable Optimization With Application To Syntactic Learning
Author Affiliations +
The recent development of an algebra for the manipulation of decision trees has allowed the implementation of an algorithm for generating all the irreducible forms of a decision tree. An irreducible is a syntactic form for a decision tree which is guaranteed to be optimal for some cost criterion (for example, an expected testing cost). However, each irreducible is optimal only under certain stability conditions. Thus, in the absence of specific costing information, the more demanding the stability conditions for an irreducible, the less generally useful the tree. This paper illustrates, by means of an example, a syntactic approach to decision tree inference in which all the irreducible decision trees which are consistent with respect to a given set of training examples are generated, and a test for stability is used to narrow down the selection of a reasonable inference model.
© (1988) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Juan A. Herrera, Juan A. Herrera, J. Robin B. Cockett, J. Robin B. Cockett, "Stable Optimization With Application To Syntactic Learning", Proc. SPIE 0937, Applications of Artificial Intelligence VI, (29 March 1988); doi: 10.1117/12.946982; https://doi.org/10.1117/12.946982

Back to Top