A machine learning‐based approach for wait‐time estimation in healthcare facilities with multi‐stage queues

IF 2.1 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS IET Smart Cities Pub Date : 2024-03-28 DOI:10.1049/smc2.12079
Amjed Al-mousa, Hamza Al‐Zubaidi, Mohammad Al‐Dweik
{"title":"A machine learning‐based approach for wait‐time estimation in healthcare facilities with multi‐stage queues","authors":"Amjed Al-mousa, Hamza Al‐Zubaidi, Mohammad Al‐Dweik","doi":"10.1049/smc2.12079","DOIUrl":null,"url":null,"abstract":"Digital technologies have been contributing to providing quality health care to patients. One aspect of this is providing accurate wait times for patients waiting to be serviced at healthcare facilities. This is naturally a complex problem as there is a multitude of factors that can impact the wait time. However, the problem becomes even more complex if the patient's journey requires visiting multiple stations in the hospital; such as having vital signs taken, doing an ultrasound, and seeing a specialist. The authors aim to provide an accurate method for estimating the wait time by utilising a real dataset of transactions collected from a major hospital over a year. The work employs feature engineering and compares several machine learning‐based algorithms to predict patients' waiting times for single‐stage and multi‐stage services. The Random Forest algorithm achieved the lowest root mean squared error (RMSE) value of 6.69 min among all machine learning algorithms. The results were also compared against a formula‐based system used in the industry, and the proposed model outperformed the existing model, showing improvements of 25.1% in RMSE and 18.9% in MAE metrics. These findings indicate a significant improvement in the accuracy of predicting waiting times compared to existing techniques.","PeriodicalId":34740,"journal":{"name":"IET Smart Cities","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Smart Cities","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/smc2.12079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Digital technologies have been contributing to providing quality health care to patients. One aspect of this is providing accurate wait times for patients waiting to be serviced at healthcare facilities. This is naturally a complex problem as there is a multitude of factors that can impact the wait time. However, the problem becomes even more complex if the patient's journey requires visiting multiple stations in the hospital; such as having vital signs taken, doing an ultrasound, and seeing a specialist. The authors aim to provide an accurate method for estimating the wait time by utilising a real dataset of transactions collected from a major hospital over a year. The work employs feature engineering and compares several machine learning‐based algorithms to predict patients' waiting times for single‐stage and multi‐stage services. The Random Forest algorithm achieved the lowest root mean squared error (RMSE) value of 6.69 min among all machine learning algorithms. The results were also compared against a formula‐based system used in the industry, and the proposed model outperformed the existing model, showing improvements of 25.1% in RMSE and 18.9% in MAE metrics. These findings indicate a significant improvement in the accuracy of predicting waiting times compared to existing techniques.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于机器学习的医疗机构多级排队等候时间估算方法
数字技术一直致力于为患者提供高质量的医疗服务。其中一个方面就是为在医疗机构等待服务的病人提供准确的等待时间。这自然是一个复杂的问题,因为影响等待时间的因素有很多。然而,如果病人的旅程需要在医院的多个站点就诊,例如测量生命体征、做超声波检查和看专科医生,问题就会变得更加复杂。作者利用从一家大型医院收集的一年来的真实交易数据集,旨在提供一种估算等待时间的精确方法。这项研究采用了特征工程学,并比较了几种基于机器学习的算法,以预测病人在单阶段和多阶段服务中的等待时间。在所有机器学习算法中,随机森林算法的均方根误差(RMSE)值最低,仅为 6.69 分钟。研究结果还与业界使用的基于公式的系统进行了比较,结果表明,所提出的模型优于现有模型,在均方根误差(RMSE)和均方根误差率(MAE)指标上分别提高了 25.1%和 18.9%。这些结果表明,与现有技术相比,预测等待时间的准确性有了显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IET Smart Cities
IET Smart Cities Social Sciences-Urban Studies
CiteScore
7.70
自引率
3.20%
发文量
25
审稿时长
21 weeks
期刊最新文献
Guest Editorial: Smart cities 2.0: How Artificial Intelligence and Internet of Things are transforming urban living A hybrid attention‐based long short‐term memory fast model for thermal regulation of smart residential buildings A collaborative WSN‐IoT‐Animal for large‐scale data collection Advancing smart tourism destinations: A case study using bidirectional encoder representations from transformers‐based occupancy predictions in torrevieja (Spain) Smart city fire surveillance: A deep state-space model with intelligent agents
×
引用
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