Evidence map›Paper›PMID 33141090›Full record

ArticleJournal of medical Internet research2020

Balancing Accuracy and Privacy in Federated Queries of Clinical Data Repositories: Algorithm Development and Validation.

Yun William Yu, Griffin M Weber

Abstract read
In one paragraph

Article in Journal of medical Internet research, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Towards cross-application model-agnostic federated cohort discovery.Journal of the American Medical Informatics Association : JAMIA · 2024
    Article
  2. Clinical Data Warehousing: A Scoping Review.Journal of the Society for Clinical Data Management · 2024
    Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Yun William YuComputer & Mathematical Sciences, University of Toronto, Toronto, ON, Canada.ORCID 0000-0002-8275-9576
Griffin M WeberDepartment of Biomedical Informatics, Harvard Medical School, Boston, MA, United States.ORCID 0000-0002-2597-881X

Funding

RESEARCH TRAINING-MEDICAL INFORMATICS 90T15LM007092 · NLM · HARVARD UNIVERSITY (SCH OF PUBLIC HLTH) · PI Nils Gehlenborg · 1992 to 2026
$32.8M
TrainingU54HG007963 · NHGRI · HARVARD MEDICAL SCHOOL · PI KOHANE, ISAAC S., MURPHY, SHAWN N · 2014 to 2018
$18.3M
Visualizing healthcare system dynamics in biomedical Big DataU01CA198934 · NCI · HARVARD MEDICAL SCHOOL · PI WEBER, GRIFFIN M · 2015 to 2017
$1.9M
Biases introduced by filtering electronic health records for patients with "complete data"R01LM013345 · NLM · HARVARD MEDICAL SCHOOL · PI WEBER, GRIFFIN M · 2020 to 2023
$1.4M
NCI NIH HHS U01 CA198934NHGRI NIH HHS U54 HG007963NLM NIH HHS R01 LM013345NLM NIH HHS T15 LM007092
6 · The paper itself

Abstract

backgroundOver the past decade, the emergence of several large federated clinical data networks has enabled researchers to access data on millions of patients at dozens of health care organizations. Typically, queries are broadcast to each of the sites in the network, which then return aggregate counts of the number of matching patients. However, because patients can receive care from multiple sites in the network, simply adding the numbers frequently double counts patients. Various methods such as the use of trusted third parties or secure multiparty computation have been proposed to link patient records across sites. However, they either have large trade-offs in accuracy and privacy or are not scalable to large networks.

objectiveThis study aims to enable accurate estimates of the number of patients matching a federated query while providing strong guarantees on the amount of protected medical information revealed.

methodsWe introduce a novel probabilistic approach to running federated network queries. It combines an algorithm called HyperLogLog with obfuscation in the form of hashing, masking, and homomorphic encryption. It is tunable, in that it allows networks to balance accuracy versus privacy, and it is computationally efficient even for large networks. We built a user-friendly free open-source benchmarking platform to simulate federated queries in large hospital networks. Using this platform, we compare the accuracy, k-anonymity privacy risk (with k=10), and computational runtime of our algorithm with several existing techniques.

resultsIn simulated queries matching 1 to 100 million patients in a 100-hospital network, our method was significantly more accurate than adding aggregate counts while maintaining k-anonymity. On average, it required a total of 12 kilobytes of data to be sent to the network hub and added only 5 milliseconds to the overall federated query runtime. This was orders of magnitude better than other approaches, which guaranteed the exact answer.

conclusionsUsing our method, it is possible to run highly accurate federated queries of clinical data repositories that both protect patient privacy and scale to large networks.

Indexed as

Data AccuracyAlgorithmsHumansPrivacyReproducibility of ResultsResearch Designalgorithmsinformation storage and retrievalmedical record linkagemedical recordsprivacy

Identifiers

PMID33141090
PMCPMC7671849

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.