]> 2012-05-27T23:31:01-04:00 A comparison of action-based hierarchies and decision trees for real-time performance 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. techreport KSL-93-24 KSL-93-24 A Comparison of Action-Based Hierarchies and Decision Trees for Real-Time Performance KSL-93-24 1993 Year Tr id Title Computer science Tag Number Key Knowledge Systems, AI Laboratory Institution Bibtype Barbara Hayes-Roth David Ash Author Washington DC Address Abstract KSL Technical Report Publication Technical Report