A Privacy-Preserving Ecosystem for Developing Machine Learning Algorithms Using Patient Data: Insights from the TUM.ai Makeathon
Simon S\"uwer, Mai Khanh Mai, Christoph Klein, Nicola G\"otzenberger, Denis Dali\'c, Andreas Maier, Jan Baumbach

TL;DR
This paper presents a multi-stage, privacy-preserving approach for developing machine learning models on sensitive patient data using federated learning and simulated knowledge graphs, validated during a healthcare AI challenge.
Contribution
It introduces a novel multi-stage method combining simulated knowledge graphs and federated learning to enable privacy-preserving AI development in healthcare.
Findings
Successful validation during TUM.ai Makeathon 2024 challenge
Models developed without access to real patient data
Demonstrated feasibility of privacy-preserving AI in clinical settings
Abstract
The integration of clinical data offers significant potential for the development of personalized medicine. However, its use is severely restricted by the General Data Protection Regulation (GDPR), especially for small cohorts with rare diseases. High-quality, structured data is essential for the development of predictive medical AI. In this case study, we propose a novel, multi-stage approach to secure AI training: (1) The model is designed on a simulated clinical knowledge graph (cKG). This graph is used exclusively to represent the structural characteristics of the real cKG without revealing any sensitive content. (2) The model is then integrated into the FeatureCloud (FC) federated learning framework, where it is prepared in a single-client configuration within a protected execution environment. (3) Training then takes place within the hospital environment on the real cKG, either…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
