PriFed-IDS: A Privacy-Preserving Federated Reinforcement Learning Framework for Secure and Intelligent Intrusion Detection in Digital Health Systems
Bibliographic record
Abstract
The Internet of Medical Things (IoMT) integrates sensors, medical devices, and Internet of Things (IoT) technologies to provide data-driven healthcare systems. The systems facilitate medical monitoring and decision-making; however, there are significant concerns about data leakage and patient consent. Additionally, a shortage of large, high-quality IoMT datasets to study the surrounding issues is problematic. Federated learning (FL) is a decentralized machine learning approach that potentially offers substantial amounts of capacity, so that compound Smart Healthcare Systems (SHSs) can further personalize and contextualize the secrecy of data and strong system structures. Additionally, to protect against advanced and shifting computational intelligence-based cyber threats, especially in operational health environments, the use of Intruder Detection Systems (IDSs) is quite essential. However, traditional approaches to implementing IDSs are usually computationally costly and inappropriate for the narrow contours of deploying medical IoT devices. To address these challenges, the proposed study introduces PriFed-IDS, a novel, privacy-preserving FL-based IDS framework based on FL and reinforcement learning. The proposed model leverages reinforcement learning to uncover latent patterns in medical data, enabling accurate anomaly detection. A dynamic federation and aggregation strategy is implemented to optimize model performance while minimizing communication overhead by adaptively engaging clients in the training process. Experimental evaluations and theoretical analysis demonstrate that PriFed-IDS significantly outperforms existing benchmark IDS models in terms of detection accuracy and efficiency, underscoring its practical applicability for securing real-world IoMT networks.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".