Learning cost-sensitive diagnostic policies from data Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/2v23vx02v

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • In its simplest form, the process of diagnosis is a decision-making process in which the diagnostician performs a sequence of tests culminating in a diagnostic decision. For example, a physician might perform a series of simple measurements (body tem- perature, weight, etc.) and laboratory measurements (white blood count, CT scan, MRI scan, etc.) in order to determine the disease of the patient. A diagnostic policy is a complete description of the decision-making actions of a diagnostician under all possible circumstances. This dissertation studies the problem of learning diagnostic policies from training examples. An optimal diagnostic policy is one that minimizes the expected total cost of diagnosing a patient, where the cost is composed of two components: (a) measurement costs (the costs of performing various diagnostic tests) and (b) misdiagnosis costs (the costs incurred when the patient is incorrectly diag- nosed). The optimal policy must perform diagnostic tests until further measurements do not reduce the expected total cost of diagnosis. The dissertation investigates two families of algorithms for learning diagnostic policies: greedy methods and methods based on the AO* algorithm for systematic search. Previous work in supervised learning constructed greedy diagnostic policies that either ignored all costs or considered only measurement costs or only misdiag- nosis costs. This research recognizes the practical importance of costs incurred by performing measurements and by making incorrect diagnoses and studies the tradeo between them. This dissertation develops improved greedy methods. It also intro- duces a new family of learning algorithms based on systematic search. Systematic search has previously been regarded as computationally infeasible for learning diag- nostic policies. However, this dissertation describes an admissible heuristic for AO* that enables it to prune large parts of the search space. In addition, the dissertation shows that policies with better performance on an independent test set are learned when the AO* method is regularized in order to reduce over tting. Experimental studies on benchmark data sets show that in most cases the sys- tematic search methods produce better diagnostic policies than the greedy methods. Hence, these AO*-based methods are recommended for learning diagnostic policies that seek to minimize the expected total cost of diagnosis.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2009-02-10T00:12:49Z (GMT). No. of bitstreams: 1 Valentina_Bayer_Zubek.pdf: 1156288 bytes, checksum: 1a72e252d245f93110c5d2e8ff14e689 (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-02-10T00:10:00Z (GMT) No. of bitstreams: 1 Valentina_Bayer_Zubek.pdf: 1156288 bytes, checksum: 1a72e252d245f93110c5d2e8ff14e689 (MD5)
  • description.provenance : Submitted by Philip Vue (vuep@onid.orst.edu) on 2009-02-09T20:45:36Z No. of bitstreams: 1 Valentina_Bayer_Zubek.pdf: 1156288 bytes, checksum: 1a72e252d245f93110c5d2e8ff14e689 (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-02-10T00:12:49Z (GMT) No. of bitstreams: 1 Valentina_Bayer_Zubek.pdf: 1156288 bytes, checksum: 1a72e252d245f93110c5d2e8ff14e689 (MD5)

Relationships

In Administrative Set:
Last modified: 08/08/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items