Integrating Learning from Examples into the Search for Diagnostic Policies

by   V. Bayer-Zubek, et al.

This paper studies the problem of learning diagnostic policies from training examples. A diagnostic policy is a complete description of the decision-making actions of a diagnostician (i.e., tests followed by a diagnostic decision) for all possible combinations of test results. An optimal diagnostic policy is one that minimizes the expected total cost, which is the sum of measurement costs and misdiagnosis costs. In most diagnostic settings, there is a tradeoff between these two kinds of costs. This paper formalizes diagnostic decision making as a Markov Decision Process (MDP). The paper introduces a new family of systematic search algorithms based on the AO* algorithm to solve this MDP. To make AO* efficient, the paper describes an admissible heuristic that enables AO* to prune large parts of the search space. The paper also introduces several greedy algorithms including some improvements over previously-published methods. The paper then addresses the question of learning diagnostic policies from examples. When the probabilities of diseases and test results are computed from training data, there is a great danger of overfitting. To reduce overfitting, regularizers are integrated into the search algorithms. Finally, the paper compares the proposed methods on five benchmark diagnostic data sets. The studies show that in most cases the systematic search methods produce better diagnostic policies than the greedy methods. In addition, the studies show that for training sets of realistic size, the systematic search algorithms are practical on todays desktop computers.


page 29

page 30


Learning Diagnostic Policies from Examples by Systematic Search

A diagnostic policy specifies what test to perform next, based on the re...

Learning Cost-Effective Treatment Regimes using Markov Decision Processes

Decision makers, such as doctors and judges, make crucial decisions such...

Markov Decision Process to Enforce Moving Target Defence Policies

Moving Target Defense (MTD) is an emerging game-changing defense strateg...

Novel Approaches to Accelerating the Convergence Rate of Markov Decision Process for Search Result Diversification

Recently, some studies have utilized the Markov Decision Process for div...

A Reinforcement Learning Approach to the Stochastic Cutting Stock Problem

We propose a formulation of the stochastic cutting stock problem as a di...

Acquisition Conditioned Oracle for Nongreedy Active Feature Acquisition

We develop novel methodology for active feature acquisition (AFA), the s...

On Greedy and Strategic Evaders in Sequential Interdiction Settings with Incomplete Information

We consider a class of sequential interdiction settings where the interd...

Please sign up or login with your details

Forgot password? Click here to reset