The stochastic score classification problem

Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    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). Each of these classes corresponds to a contiguous range of scores. Test i has probability pi of being positive, and it costs ci 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.

    Original languageEnglish (US)
    Title of host publication26th European Symposium on Algorithms, ESA 2018
    EditorsHannah Bast, Grzegorz Herman, Yossi Azar
    PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
    Volume112
    ISBN (Print)9783959770811
    DOIs
    StatePublished - Aug 1 2018
    Event26th European Symposium on Algorithms, ESA 2018 - Helsinki, Finland
    Duration: Aug 20 2018Aug 22 2018

    Other

    Other26th European Symposium on Algorithms, ESA 2018
    CountryFinland
    CityHelsinki
    Period8/20/188/22/18

    Fingerprint

    Costs
    Testing
    Approximation algorithms

    Keywords

    • Adaptivity
    • Approximation algorithms
    • Sequential testing
    • Stochastic probing
    • Symmetric boolean functions

    ASJC Scopus subject areas

    • Software

    Cite this

    Gkenosis, D., Grammel, N., Hellerstein, L., & Kletenik, D. (2018). The stochastic score classification problem. In H. Bast, G. Herman, & Y. Azar (Eds.), 26th European Symposium on Algorithms, ESA 2018 (Vol. 112). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2018.36

    The stochastic score classification problem. / Gkenosis, Dimitrios; Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah.

    26th European Symposium on Algorithms, ESA 2018. ed. / Hannah Bast; Grzegorz Herman; Yossi Azar. Vol. 112 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Gkenosis, D, Grammel, N, Hellerstein, L & Kletenik, D 2018, The stochastic score classification problem. in H Bast, G Herman & Y Azar (eds), 26th European Symposium on Algorithms, ESA 2018. vol. 112, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 26th European Symposium on Algorithms, ESA 2018, Helsinki, Finland, 8/20/18. https://doi.org/10.4230/LIPIcs.ESA.2018.36
    Gkenosis D, Grammel N, Hellerstein L, Kletenik D. The stochastic score classification problem. In Bast H, Herman G, Azar Y, editors, 26th European Symposium on Algorithms, ESA 2018. Vol. 112. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2018 https://doi.org/10.4230/LIPIcs.ESA.2018.36
    Gkenosis, Dimitrios ; Grammel, Nathaniel ; Hellerstein, Lisa ; Kletenik, Devorah. / The stochastic score classification problem. 26th European Symposium on Algorithms, ESA 2018. editor / Hannah Bast ; Grzegorz Herman ; Yossi Azar. Vol. 112 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018.
    @inproceedings{31e1d24ffb8849f69ba8663f584abfc2,
    title = "The stochastic score classification problem",
    abstract = "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). Each of these classes corresponds to a contiguous range of scores. Test i has probability pi of being positive, and it costs ci 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.",
    keywords = "Adaptivity, Approximation algorithms, Sequential testing, Stochastic probing, Symmetric boolean functions",
    author = "Dimitrios Gkenosis and Nathaniel Grammel and Lisa Hellerstein and Devorah Kletenik",
    year = "2018",
    month = "8",
    day = "1",
    doi = "10.4230/LIPIcs.ESA.2018.36",
    language = "English (US)",
    isbn = "9783959770811",
    volume = "112",
    editor = "Hannah Bast and Grzegorz Herman and Yossi Azar",
    booktitle = "26th European Symposium on Algorithms, ESA 2018",
    publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

    }

    TY - GEN

    T1 - The stochastic score classification problem

    AU - Gkenosis, Dimitrios

    AU - Grammel, Nathaniel

    AU - Hellerstein, Lisa

    AU - Kletenik, Devorah

    PY - 2018/8/1

    Y1 - 2018/8/1

    N2 - 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). Each of these classes corresponds to a contiguous range of scores. Test i has probability pi of being positive, and it costs ci 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.

    AB - 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). Each of these classes corresponds to a contiguous range of scores. Test i has probability pi of being positive, and it costs ci 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.

    KW - Adaptivity

    KW - Approximation algorithms

    KW - Sequential testing

    KW - Stochastic probing

    KW - Symmetric boolean functions

    UR - http://www.scopus.com/inward/record.url?scp=85052512208&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85052512208&partnerID=8YFLogxK

    U2 - 10.4230/LIPIcs.ESA.2018.36

    DO - 10.4230/LIPIcs.ESA.2018.36

    M3 - Conference contribution

    SN - 9783959770811

    VL - 112

    BT - 26th European Symposium on Algorithms, ESA 2018

    A2 - Bast, Hannah

    A2 - Herman, Grzegorz

    A2 - Azar, Yossi

    PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

    ER -