...
首页> 外文期刊>PLoS One >Statistical methods versus machine learning techniques for donor-recipient matching in liver transplantation
【24h】

Statistical methods versus machine learning techniques for donor-recipient matching in liver transplantation

机译:统计方法与肝移植中供体受体匹配的机器学习技术

获取原文
           

摘要

Donor-Recipient (D-R) matching is one of the main challenges to be fulfilled nowadays. Due to the increasing number of recipients and the small amount of donors in liver transplantation, the allocation method is crucial. In this paper, to establish a fair comparison, the United Network for Organ Sharing database was used with 4 different end-points (3 months, and 1, 2 and 5 years), with a total of 39, 189 D-R pairs and 28 donor and recipient variables. Modelling techniques were divided into two groups: 1) classical statistical methods, including Logistic Regression (LR) and Na?ve Bayes (NB), and 2) standard machine learning techniques, including Multilayer Perceptron (MLP), Random Forest (RF), Gradient Boosting (GB) or Support Vector Machines (SVM), among others. The methods were compared with standard scores, MELD, SOFT and BAR. For the 5-years end-point, LR (AUC = 0.654) outperformed several machine learning techniques, such as MLP (AUC = 0.599), GB (AUC = 0.600), SVM (AUC = 0.624) or RF (AUC = 0.644), among others. Moreover, LR also outperformed standard scores. The same pattern was reproduced for the others 3 end-points. Complex machine learning methods were not able to improve the performance of liver allocation, probably due to the implicit limitations associated to the collection process of the database.
机译:捐助者(D-R)匹配是如今所满足的主要挑战之一。由于患者数量越来越多,肝移植中的少量供体,分配方法至关重要。在本文中,为了建立公平的比较,与器官共享数据库的联合网络与4个不同的终点(3个月和1,2和5年)一起使用,共有39,189次成对和28个捐助者和收件人变量。建模技术分为两组:1)古典统计方法,包括逻辑回归(LR)和Naα贝雷斯(NB)和2)标准机器学习技术,包括多层的感知(MLP),随机森林(RF),梯度升压(GB)或支持向量机(SVM)等。将该方法与标准分数,熔融,柔软和棒进行比较。对于5年的终点,LR(AUC = 0.654)优于多种机器学习技术,例如MLP(AUC = 0.599),GB(AUC = 0.600),SVM(AUC = 0.624)或RF(AUC = 0.644)等等。此外,LR也表现出标准分数。为其他3个终点转载了相同的模式。复杂的机器学习方法无法提高肝分配的性能,可能是由于与数据库的收集过程相关的隐含限制。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号