arrow
返回

Machine learning for surgical time prediction

delete2021-09-01
delete37
delete
OA
AI
O
Oscar D. Martínez-Bernal
C
Carol Martínez
C
Carlos Parra
S
Saúl Rugéles
D
Daniel R. Suárez *
DOI:10.1016/j.cmpb.2021.106220delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Background and Objective: Operating Rooms (ORs) are among the most expensive services in hospitals. A challenge to optimize the OR efficiency is to improve the surgery scheduling task, which requires the estimation of surgical time duration. Surgeons or programming units (based on people's experience) typically do the duration estimation using an experience-based strategy, which may include some bias, such as overestimating the surgery time, increasing ORs' operational cost. Methods: This paper analyzes a machine learning-based solution for surgical time predictions. We apply and compare four machine-learning algorithms (Linear Regression, Support Vector Machines, Regression Trees, and Bagged Trees) to predict the surgical time duration at a tertiary referral university hospital in Bogota, Colombia. Historical data from 2004 until 2019 was used to train the algorithms. Comparison among algorithms was given in terms of the Root Mean Square Error (RMSE) of the predicted surgery duration and the algorithms' computing time. The algorithm with the best performance was compared to the currently used experience-based method. Results: All the ML algorithms predict the surgery duration with an error between 26 and 37 min. The best overall performance was obtained using Bagged Trees (26 min RMSE, 3.16 min training time, 0.49 min testing time) when using a subset of the DB with the nine specialties containing 80% of the surgeries. Bagged Trees also outperformed the experience-based method with a lower RMSE; however, it also shifted from a predominant overestimation to underestimating surgeries' duration. Conclusions: Different ML algorithms for predicting the surgical time duration, showing and comparing their performance. Bagged Trees showed the best performance in terms of RMSE and computing time. Depending on the initial data, Bagged Trees outperformed the experience-based method, but future work is necessary to suit it, like any other ML algorithm, to the hospitals' needs. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Machine learning
Surgical time prediction
Linear regression
Support vector machine
Regression trees
Assembly methods
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Computer Methods and Programs in Biomedicine 封面图
Computer Methods and Programs in Biomedicine
IF:
4.8
论文数:
7.0K
被引数:
2.1W

机构

H
Hospital Universitario San Ignacio
学者数:
669
论文数: 365
被引数: 351
P
Pontificia Universidad Javeriana
学者数:
4.1K
论文数: 2.4K
被引数: 2.2K
U
university of luxembourg
学者数:
5.2K
论文数: 4.8K
被引数: 4
学者 查看更多机构
引用论文

引用论文

Improving the Prediction of Total Surgical Procedure Time Using Linear Regression Modeling
err2017-06-19
err39
errOAAI
errEdelman, Eric R.; van Kuijk, Sander M. J.; Hamaekers, Ankie E. W.; de Korte, Marcel J. M.; van Merode, Godefridus G.; Buhre, Wolfgang F. F. A.
err分享
err收藏
Molecular Markers of Endometrial Epithelial Cell Mitogenesis Mediated by the Sp/Krüppel-Like Factor BTEB1
err2002-02-01
err0
PREAI
errRosalia C.M. Simmen; Xue-Lian Zhang; Frank J. Michel; Seok Hong Min; Ge Zhao; Frank A. Simmen
err分享
err收藏
err分享
err收藏
没有更多内容