Resource-Aware Federated Hybrid Profiling for Edge Node Selection in Federated Patient Similarity Network
Bibliographic record
Abstract
The widespread adoption of edge computing for resource-constrained devices presents challenges in computational straggler issues, primarily due to the heterogeneity of edge node resources. This research addresses these issues by introducing a novel resource-aware federated hybrid profiling approach. This approach involves classifying edge node resources with relevant performance metrics and leveraging their capabilities to optimize performance and improve Quality of Service (QoS), particularly in real-time eHealth applications. Such paradigms include Federated Patient Similarity Network (FPSN) models that distribute processing at each edge node and fuse the built PSN matrices in the cloud, presenting a unique challenge in terms of optimizing training and inference times, while ensuring efficient and timely updates at the edge nodes. To address this concern, we propose a resource-aware federated hybrid profiling approach that measures the available static and dynamic resources of the edge nodes. By selecting nodes with the appropriate resources, we aim to optimize the FPSN to ensure the highest possible Quality of Service (QoS) for its users. We conducted experiments using edge performance metrics, i.e., accuracy, training convergence, memory and disk usage, execution time, and network statistics. These experiments uniquely demonstrate our work’s contribution to optimizing resource allocation and enhancing the performance of eHealth applications in real-time contexts using edge computing.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".