Accession Number:

ADA110254

Title:

A Note on Computing the Asymptotic Form of a Limited Sequence of Decision Trees.

Descriptive Note:

Interim technical rept. 1 Jul 80-30 Jun 81,

Corporate Author:

STATE UNIV OF NEW YORK AT BUFFALO AMHERST DEPT OF COMPUTER SCIENCE

Report Date:

1981-11-01

Pagination or Media Count:

44.0

Abstract:

It is often desirable to compute the asymptotic form of a limited sequence of decision trees DTs after the set of decision variables has reached a stable, constant membership. Such is the case when the DTs characterize the evolving behavior of a learning strategy in the Quasi-Optimizer system under development. An algorithm is described which builds the asymptotic decision tree in breadth-first order, node-by-node, starting at the root. In the course of computing the asymptotic value of a node that is, its out-degree and the limiting points of its subranges, three situations may arise 1 the computation is possible 2 the computation seems to be possible but more DTs have to be acquired of the evolving strategy to reach the desired level of statistical significance 3 the computation is not possible. Author

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE