Predicting no-shows for dental appointments.

PeerJ Computer Science Pub Date : 2022-11-09 eCollection Date: 2022-01-01 DOI:10.7717/peerj-cs.1147
Yazeed Alabdulkarim, Mohammed Almukaynizi, Abdulmajeed Alameer, Bassil Makanati, Riyadh Althumairy, Abdulaziz Almaslukh
{"title":"Predicting no-shows for dental appointments.","authors":"Yazeed Alabdulkarim,&nbsp;Mohammed Almukaynizi,&nbsp;Abdulmajeed Alameer,&nbsp;Bassil Makanati,&nbsp;Riyadh Althumairy,&nbsp;Abdulaziz Almaslukh","doi":"10.7717/peerj-cs.1147","DOIUrl":null,"url":null,"abstract":"<p><p>Patient no-shows is a significant problem in healthcare, reaching up to 80% of booked appointments and costing billions of dollars. Predicting no-shows for individual patients empowers clinics to implement better mitigation strategies. Patients' no-show behavior varies across health clinics and the types of appointments, calling for fine-grained studies to uncover these variations in no-show patterns. This article focuses on dental appointments because they are notably longer than regular medical appointments due to the complexity of dental procedures. We leverage machine learning techniques to develop predictive models for dental no-shows, with the best model achieving an Area Under the Curve (AUC) of 0.718 and an F1 score of 66.5%. Additionally, we propose and evaluate a novel method to represent no-show history as a binary sequence of events, enabling the predictive models to learn the associated future no-show behavior with these patterns. We discuss the utility of no-show predictions to improve the scheduling of dental appointments, such as reallocating appointments and reducing their duration.</p>","PeriodicalId":503620,"journal":{"name":"PeerJ Computer Science","volume":" ","pages":"e1147"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9680883/pdf/","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.1147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2022/1/1 0:00:00","PubModel":"eCollection","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Patient no-shows is a significant problem in healthcare, reaching up to 80% of booked appointments and costing billions of dollars. Predicting no-shows for individual patients empowers clinics to implement better mitigation strategies. Patients' no-show behavior varies across health clinics and the types of appointments, calling for fine-grained studies to uncover these variations in no-show patterns. This article focuses on dental appointments because they are notably longer than regular medical appointments due to the complexity of dental procedures. We leverage machine learning techniques to develop predictive models for dental no-shows, with the best model achieving an Area Under the Curve (AUC) of 0.718 and an F1 score of 66.5%. Additionally, we propose and evaluate a novel method to represent no-show history as a binary sequence of events, enabling the predictive models to learn the associated future no-show behavior with these patterns. We discuss the utility of no-show predictions to improve the scheduling of dental appointments, such as reallocating appointments and reducing their duration.

Abstract Image

Abstract Image

Abstract Image

预测不去看牙医。
病人不来是医疗保健领域的一个严重问题,高达80%的预约都是这样,造成了数十亿美元的损失。预测个别病人的缺席情况,使诊所能够实施更好的缓解策略。不同的诊所和不同类型的预约,患者的“不来”行为各不相同,因此需要进行细致的研究,以揭示“不来”模式的这些差异。本文主要关注牙科预约,因为由于牙科程序的复杂性,牙科预约明显比常规医疗预约要长。我们利用机器学习技术开发牙科缺席预测模型,最佳模型的曲线下面积(AUC)为0.718,F1得分为66.5%。此外,我们提出并评估了一种新颖的方法,将缺席历史表示为二值事件序列,使预测模型能够通过这些模式学习相关的未来缺席行为。我们讨论了缺席预测的效用,以改善牙科预约的安排,如重新分配预约和减少他们的持续时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书