A Heterogeneous Bipartite Graph Framework for Donor-Recipient Matching in Kidney Transplantation
This paper presents a novel graph-based framework for donor-recipient matching for organ transplantation, specifically targeting kidney transplantation. We pursue donor-recipient matching as a feature set matching problem using a graph-based approach. To represent kidney transplant clinical and operational considerations, we developed a kidney transplant graph by embedding kidney transplantation knowledge and relevant datasets to capture the complex relationships between the heterogeneous donor and recipient feature sets to provide a system for optimal donor and recipient matches. Our approach includes multi-dimensional graph edge types representing clinical considerations to provide comprehensive and optimal pairs. We propose the kidney transplant graph with a graph neural network to optimize donor-recipient compatibility predictions, enhancing decision-making in transplantation.
Authors
- Karthik Tennankore (ORCID: https://orcid.org/0000-0002-7919-6709)
- Samina Abidi (ORCID: https://orcid.org/0000-0002-7805-6122)
- George Worthen (ORCID: https://orcid.org/0000-0003-2437-0914)
- Sheida Majouni
- Syed Sibte Raza Abidi (ORCID: https://orcid.org/0000-0003-3075-7736)
- Amanda J. Vinson (ORCID: https://orcid.org/0000-0002-9345-5252)
Institutions
- Dalhousie University (CA)
Publication Details
- Journal
- Studies in health technology and informatics
- Published
- 2025-05-15
- DOI
- https://doi.org/10.3233/shti250394
- Citations
- 1
- Primary Topic
- Renal Transplantation Outcomes and Treatments
- Type
- article
- Field-Weighted Citation Impact
- 23.40