重症监护病房拥挤风险的可解释预测规则

Q1 Mathematics Stochastic Systems Pub Date : 2023-07-17 DOI:10.1287/stsy.2022.0018
Fernanda Bravo, C. Rudin, Yaron Shaposhnik, Yuting Yuan
{"title":"重症监护病房拥挤风险的可解释预测规则","authors":"Fernanda Bravo, C. Rudin, Yaron Shaposhnik, Yuting Yuan","doi":"10.1287/stsy.2022.0018","DOIUrl":null,"url":null,"abstract":"We study the problem of predicting congestion risk in intensive care units (ICUs). Congestion is associated with poor service experience, high costs, and poor health outcomes. By predicting future congestion, decision makers can initiate preventive measures, such as rescheduling activities or increasing short-term capacity, to mitigate the effects of congestion. To this end, we consider well-established queueing models of ICUs and define “high-risk states” as system states that are likely to lead to congestion in the near future. We strive to formulate rules for determining whether a given system state is high risk. We design the rules to be interpretable (informally, easy to understand) for their practical appeal to stakeholders. We show that for simple Markovian queueing systems, such as the [Formula: see text] queue with multiple patient classes, our rules take the form of linear and quadratic functions on the state space. For more general queueing systems, we employ methods from queueing theory, simulation, and machine learning (ML) to devise interpretable prediction rules, and we demonstrate their effectiveness through an extensive computational study, which includes a large-scale ICU model validated using data. Our study shows that congestion risk can be effectively and transparently predicted using linear ML models and interpretable features engineered from the queueing model representation of the system. History: This paper has been accepted for the Service Science/Stochastic Systems Joint Special Issue. Supplemental Material: The online appendix is available at https://doi.org/10.1287/stsy.2022.0018 .","PeriodicalId":36337,"journal":{"name":"Stochastic Systems","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Interpretable Prediction Rules for Congestion Risk in Intensive Care Units\",\"authors\":\"Fernanda Bravo, C. Rudin, Yaron Shaposhnik, Yuting Yuan\",\"doi\":\"10.1287/stsy.2022.0018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of predicting congestion risk in intensive care units (ICUs). Congestion is associated with poor service experience, high costs, and poor health outcomes. By predicting future congestion, decision makers can initiate preventive measures, such as rescheduling activities or increasing short-term capacity, to mitigate the effects of congestion. To this end, we consider well-established queueing models of ICUs and define “high-risk states” as system states that are likely to lead to congestion in the near future. We strive to formulate rules for determining whether a given system state is high risk. We design the rules to be interpretable (informally, easy to understand) for their practical appeal to stakeholders. We show that for simple Markovian queueing systems, such as the [Formula: see text] queue with multiple patient classes, our rules take the form of linear and quadratic functions on the state space. For more general queueing systems, we employ methods from queueing theory, simulation, and machine learning (ML) to devise interpretable prediction rules, and we demonstrate their effectiveness through an extensive computational study, which includes a large-scale ICU model validated using data. Our study shows that congestion risk can be effectively and transparently predicted using linear ML models and interpretable features engineered from the queueing model representation of the system. History: This paper has been accepted for the Service Science/Stochastic Systems Joint Special Issue. Supplemental Material: The online appendix is available at https://doi.org/10.1287/stsy.2022.0018 .\",\"PeriodicalId\":36337,\"journal\":{\"name\":\"Stochastic Systems\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Stochastic Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/stsy.2022.0018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Stochastic Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/stsy.2022.0018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

摘要

我们研究了重症监护室(ICU)拥挤风险的预测问题。拥堵与糟糕的服务体验、高昂的成本和糟糕的健康结果有关。通过预测未来的拥堵,决策者可以采取预防措施,如重新安排活动或增加短期容量,以减轻拥堵的影响。为此,我们考虑了已建立的ICU排队模型,并将“高风险状态”定义为在不久的将来可能导致拥堵的系统状态。我们努力制定规则来确定给定的系统状态是否具有高风险。我们将规则设计为可解释的(非正式的,易于理解的),以使其对利益相关者具有实际吸引力。我们证明了对于简单的马尔可夫排队系统,例如具有多个病人类的[公式:见正文]队列,我们的规则采用状态空间上的线性和二次函数的形式。对于更一般的排队系统,我们使用排队理论、模拟和机器学习(ML)的方法来设计可解释的预测规则,并通过广泛的计算研究证明了它们的有效性,其中包括使用数据验证的大规模ICU模型。我们的研究表明,使用线性ML模型和根据系统的排队模型表示设计的可解释特征,可以有效、透明地预测拥塞风险。历史:这篇论文已被服务科学/随机系统联合特刊接受。补充材料:在线附录可在https://doi.org/10.1287/stsy.2022.0018。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Interpretable Prediction Rules for Congestion Risk in Intensive Care Units
We study the problem of predicting congestion risk in intensive care units (ICUs). Congestion is associated with poor service experience, high costs, and poor health outcomes. By predicting future congestion, decision makers can initiate preventive measures, such as rescheduling activities or increasing short-term capacity, to mitigate the effects of congestion. To this end, we consider well-established queueing models of ICUs and define “high-risk states” as system states that are likely to lead to congestion in the near future. We strive to formulate rules for determining whether a given system state is high risk. We design the rules to be interpretable (informally, easy to understand) for their practical appeal to stakeholders. We show that for simple Markovian queueing systems, such as the [Formula: see text] queue with multiple patient classes, our rules take the form of linear and quadratic functions on the state space. For more general queueing systems, we employ methods from queueing theory, simulation, and machine learning (ML) to devise interpretable prediction rules, and we demonstrate their effectiveness through an extensive computational study, which includes a large-scale ICU model validated using data. Our study shows that congestion risk can be effectively and transparently predicted using linear ML models and interpretable features engineered from the queueing model representation of the system. History: This paper has been accepted for the Service Science/Stochastic Systems Joint Special Issue. Supplemental Material: The online appendix is available at https://doi.org/10.1287/stsy.2022.0018 .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Stochastic Systems
Stochastic Systems Decision Sciences-Statistics, Probability and Uncertainty
CiteScore
3.70
自引率
0.00%
发文量
18
期刊最新文献
Sharp Waiting-Time Bounds for Multiserver Jobs Asymptotic Optimality of Switched Control Policies in a Simple Parallel Server System Under an Extended Heavy Traffic Condition Distributionally Robust Observable Strategic Queues The BAR Approach for Multiclass Queueing Networks with SBP Service Policies Ergodic Control of Bipartite Matching Queues with Class Change and Matching Failure
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1