ArticleComputational and structural biotechnology journal2024
Federated attention consistent learning models for prostate cancer diagnosis and Gleason grading.
Article in Computational and structural biotechnology journal, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
7 citing papers in PubMed.
- Current Applications and Future Directions of Artificial Intelligence in Prostate Cancer Diagnosis: A Narrative Review.Current oncology (Toronto, Ont.) · 2026Review
- Differential privacy for medical deep learning: methods, tradeoffs, and deployment implications.NPJ digital medicine · 2026Article
- Artificial intelligence in prostate biopsy: diagnostic applications, risk stratification, and precision oncology.Frontiers in oncology · 2026Review
- Attention-enhanced hybrid U-Net for prostate cancer grading and explainability.Scientific reports · 2025Article
- Histolytics: A panoptic spatial analysis framework for interpretable histopathology.Computational and structural biotechnology journal · 2025Article
- Deep learning-based automated detection of endometrioid endometrial carcinoma in histopathology.Frontiers in oncology · 2025Article
- A review on federated learning in computational pathology.Computational and structural biotechnology journal · 2024Review
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
13 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Artificial intelligence (AI) holds significant promise in transforming medical imaging, enhancing diagnostics, and refining treatment strategies. However, the reliance on extensive multicenter datasets for training AI models poses challenges due to privacy concerns. Federated learning provides a solution by facilitating collaborative model training across multiple centers without sharing raw data. This study introduces a federated attention-consistent learning (FACL) framework to address challenges associated with large-scale pathological images and data heterogeneity. FACL enhances model generalization by maximizing attention consistency between local clients and the server model. To ensure privacy and validate robustness, we incorporated differential privacy by introducing noise during parameter transfer. We assessed the effectiveness of FACL in cancer diagnosis and Gleason grading tasks using 19,461 whole-slide images of prostate cancer from multiple centers. In the diagnosis task, FACL achieved an area under the curve (AUC) of 0.9718, outperforming seven centers with an average AUC of 0.9499 when categories are relatively balanced. For the Gleason grading task, FACL attained a Kappa score of 0.8463, surpassing the average Kappa score of 0.7379 from six centers. In conclusion, FACL offers a robust, accurate, and cost-effective AI training model for prostate cancer pathology while maintaining effective data safeguards.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.