The Stochastic Score Classification Problem

Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Michael Wagner
2018 European Symposium on Algorithms  
Consider the following Stochastic Score Classification Problem. A doctor is assessing a patient's risk of developing a certain disease, and can perform n tests on the patient. Each test has a binary outcome, positive or negative. A positive result is an indication of risk, and a patient's score is the total number of positive test results. Test results are accurate. The doctor needs to classify the patient into one of B risk classes, depending on the score (e.g., LOW, MEDIUM, and HIGH risk).
more » ... h of these classes corresponds to a contiguous range of scores. Test i has probability p i of being positive, and it costs c i to perform. To reduce costs, instead of performing all tests, the doctor will perform them sequentially and stop testing when it is possible to determine the patient's risk category. The problem is to determine the order in which the doctor should perform the tests, so as to minimize expected testing cost. We provide approximation algorithms for adaptive and non-adaptive versions of this problem, and pose a number of open questions.
doi:10.4230/lipics.esa.2018.36 dblp:conf/esa/GkenosisGHK18 fatcat:6dohzmuejfcr7fmazd4hsmd65i