A Comparison of Action-Based Hierarchies and Decision Trees for Real-Time Performance

From Tetherless World Wiki

(Redirected from KSL-93-24)
Jump to: navigation, search

Citation: David Ash and Barbara Hayes-Roth. (1993) A Comparison of Action-Based Hierarchies and Decision Trees for Real-Time Performance. In KSL-93-24, 1993.

Publication techreport ( Edit )
type Technical Report
bibtype techreport
Bibtex basics
author David Ash and Barbara Hayes-Roth
title A Comparison of Action-Based Hierarchies and Decision Trees for Real-Time Performance
number KSL-93-24
institution Knowledge Systems, AI Laboratory
address Washington DC
year 1993
Bibtex more
Access Paper
abstract Decision trees have provided a classical mechanism for progressively narrowing down a search from a large group of possibilities to a single alternative. The structuring of a decision tree is based on a heuristic that maximizes the value of the information gained at each level in the hierarchy. Decision trees are effective when an agent needs to reach the goal of complete diagnosis as quickly as possible and cannot accept a partial solution. We present an alternative to the decision tree heuristic which is useful when partial solutions do have value and when limited resources may require an agent to accept a partial solution. Our heuristic maximizes the improvement in the value of the partial solution gained at each level in the hierarchy; we term the resulting structure an action-based hierarchy. We present the results of a set of experiments designed to compare these two heuristics for hierarchy structuring. Finally, we describe some preliminary work we have done in applying these ideas to a medical domain--surgical intensive care unit (SICU) patient monitoring.

KSL Technical Report ID: KSL-93-24
Facts about A Comparison of Action-Based Hierarchies and Decision Trees for Real-Time PerformanceRDF feed
Abstract Decision trees have provided a classical m … Decision trees have provided a classical mechanism for progressively narrowing down a search from a large group of possibilities to a single alternative. The structuring of a decision tree is based on a heuristic that maximizes the value of the information gained at each level in the hierarchy. Decision trees are effective when an agent needs to reach the goal of complete diagnosis as quickly as possible and cannot accept a partial solution. We present an alternative to the decision tree heuristic which is useful when partial solutions do have value and when limited resources may require an agent to accept a partial solution. Our heuristic maximizes the improvement in the value of the partial solution gained at each level in the hierarchy; we term the resulting structure an action-based hierarchy. We present the results of a set of experiments designed to compare these two heuristics for hierarchy structuring. Finally, we describe some preliminary work we have done in applying these ideas to a medical domain--surgical intensive care unit (SICU) patient monitoring. nsive care unit (SICU) patient monitoring.
Address Washington DC  +
Author David Ash and Barbara Hayes-Roth  +
Bibtype techreport  +
Has author David Ash and Barbara Hayes-Roth  +
Has identifier KSL-93-24  +
Has publishing details 1993  +
Has title A Comparison of Action-Based Hierarchies and Decision Trees for Real-Time Performance  +
Has where published KSL-93-24  +
Has year 1993  +
Institution Knowledge Systems, AI Laboratory  +
Ksl tr id KSL-93-24  +
Number KSL-93-24  +
Process note NO  +
Title A Comparison of Action-Based Hierarchies and Decision Trees for Real-Time Performance  +
Year 1993  +
Retrieved from "http://tw.rpi.edu/wiki/A_Comparison_of_Action-Based_Hierarchies_and_Decision_Trees_for_Real-Time_Performance"
Personal tools