Adaptively Weighted Top-N Recommendation for Organ Matching

• URL: http://arxiv.org/abs/2107.10971v1
• Date: Fri, 23 Jul 2021 00:42:01 GMT
• Title: Adaptively Weighted Top-N Recommendation for Organ Matching
• Authors: Parshin Shojaee, Xiaoyu Chen and Ran Jin
• Abstract summary: We propose an Adaptively Weighted Top-N Recommendation (AWTR) method for organ matching decision-making. AWTR improves performance of the current scoring models by using limited actual matching performance in historical data set. AWTR sacrifices the overall recommendation accuracy by emphasizing the recommendation and ranking accuracy for top-N matched patients.
• Score: 5.585270308006354
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reducing the shortage of organ donations to meet the demands of patients on the waiting list has being a major challenge in organ transplantation. Because of the shortage, organ matching decision is the most critical decision to assign the limited viable organs to the most suitable patients. Currently, organ matching decisions were only made by matching scores calculated via scoring models, which are built by the first principles. However, these models may disagree with the actual post-transplantation matching performance (e.g., patient's post-transplant quality of life (QoL) or graft failure measurements). In this paper, we formulate the organ matching decision-making as a top-N recommendation problem and propose an Adaptively Weighted Top-N Recommendation (AWTR) method. AWTR improves performance of the current scoring models by using limited actual matching performance in historical data set as well as the collected covariates from organ donors and patients. AWTR sacrifices the overall recommendation accuracy by emphasizing the recommendation and ranking accuracy for top-N matched patients. The proposed method is validated in a simulation study, where KAS [60] is used to simulate the organ-patient recommendation response. The results show that our proposed method outperforms seven state-of-the-art top-N recommendation benchmark methods.

Related papers

• Optimizing Hard-to-Place Kidney Allocation: A Machine Learning Approach to Center Ranking [0.4893345190925178]
  This paper proposes a data-driven, machine learning-based ranking system for allocating hard-to-place kidneys to centers. Our experiments demonstrate that the proposed policy can reduce the average number of centers considered before placement by fourfold for all kidneys and tenfold for hard-to-place kidneys.
  arXiv  Detail & Related papers  (2024-10-10T17:15:41Z)
• Towards Efficient Patient Recruitment for Clinical Trials: Application of a Prompt-Based Learning Model [0.7373617024876725]
  Clinical trials are essential for advancing pharmaceutical interventions, but they face a bottleneck in selecting eligible participants. The complex nature of unstructured medical texts presents challenges in efficiently identifying participants. In this study, we aimed to evaluate the performance of a prompt-based large language model for the cohort selection task.
  arXiv  Detail & Related papers  (2024-04-24T20:42:28Z)
• Machine learning-based patient selection in an emergency department [0.0]
  This paper investigates the potential of an Machine Learning (ML) based patient selection method. It incorporates a comprehensive state representation of the system and a complex non-linear selection function. Results show that the proposed method significantly outperforms the APQ method for a majority of evaluated settings.
  arXiv  Detail & Related papers  (2022-06-08T08:56:52Z)
• Learning $\mathbf{\mathit{Matching}}$ Representations for Individualized Organ Transplantation Allocation [98.43063331640538]
  We formulate the problem of learning data-driven rules for organ matching using observational data for organ allocations and transplant outcomes. We propose a model based on representation learning to predict donor-recipient compatibility. Our model outperforms state-of-art allocation methods and policies executed by human experts.
  arXiv  Detail & Related papers  (2021-01-28T01:33:21Z)
• iPhantom: a framework for automated creation of individualized computational phantoms and its application to CT organ dosimetry [58.943644554192936]
  This study aims to develop and validate a novel framework, iPhantom, for automated creation of patient-specific phantoms or digital-twins. The framework is applied to assess radiation dose to radiosensitive organs in CT imaging of individual patients. iPhantom precisely predicted all organ locations with good accuracy of Dice Similarity Coefficients (DSC) >0.6 for anchor organs and DSC of 0.3-0.9 for all other organs.
  arXiv  Detail & Related papers  (2020-08-20T01:50:49Z)
• Aligning with Heterogeneous Preferences for Kidney Exchange [7.858296711223292]
  We propose a methodology for prioritizing patients based on heterogeneous moral preferences. We find that this methodology increases the average rank of matched patients in the sampled preference ordering, indicating better satisfaction of group preferences.
  arXiv  Detail & Related papers  (2020-06-16T21:16:53Z)
• Adapting a Kidney Exchange Algorithm to Align with Human Values [59.395925461012126]
  We provide an end-to-end methodology for estimating weights of individual participant profiles in a kidney exchange. We show how to use these weights in kidney exchange market clearing algorithms.
  arXiv  Detail & Related papers  (2020-05-19T21:00:29Z)
• DTR Bandit: Learning to Make Response-Adaptive Decisions With Low Regret [59.81290762273153]
  Dynamic treatment regimes (DTRs) are personalized, adaptive, multi-stage treatment plans that adapt treatment decisions to an individual's initial features and to intermediate outcomes and features at each subsequent stage. We propose a novel algorithm that, by carefully balancing exploration and exploitation, is guaranteed to achieve rate-optimal regret when the transition and reward models are linear.
  arXiv  Detail & Related papers  (2020-05-06T13:03:42Z)
• Noisy Adaptive Group Testing using Bayesian Sequential Experimental Design [63.48989885374238]
  When the infection prevalence of a disease is low, Dorfman showed 80 years ago that testing groups of people can prove more efficient than testing people individually. Our goal in this paper is to propose new group testing algorithms that can operate in a noisy setting.
  arXiv  Detail & Related papers  (2020-04-26T23:41:33Z)
• DeepEnroll: Patient-Trial Matching with Deep Embedding and Entailment Prediction [67.91606509226132]
  Clinical trials are essential for drug development but often suffer from expensive, inaccurate and insufficient patient recruitment. DeepEnroll is a cross-modal inference learning model to jointly encode enrollment criteria (tabular data) into a shared latent space for matching inference.
  arXiv  Detail & Related papers  (2020-01-22T17:51:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.