Evidence map›Paper›PMID 32657380›Full record

ArticleBioinformatics (Oxford, England)2020

Privacy-preserving construction of generalized linear mixed model for biomedical computation.

Rui Zhu, Chao Jiang, Xiaofeng Wang, Shuang Wang, Hao Zheng, Haixu Tang

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing 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

13 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Centralized and Federated Models for the Analysis of Clinical Data.Annual review of biomedical data science · 2024
    Review
  6. Article
  7. Review
  8. Article
  9. Review
  10. Article
  11. Article
  12. Article
  13. 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

6 authors.

Rui ZhuLuddy School of Informatics, Computing, and Engineering, Indiana University, Bloomington, IN 47405, USA.
Chao JiangDepartment of Computer Science and Software Engineering, Auburn University, Auburn, AL 36849, USA.
Xiaofeng WangLuddy School of Informatics, Computing, and Engineering, Indiana University, Bloomington, IN 47405, USA.
Shuang WangLuddy School of Informatics, Computing, and Engineering, Indiana University, Bloomington, IN 47405, USA.
Hao ZhengDepartment of Bioinformatics, Hangzhou Nuowei Information Technology, Hangzhou 310053, China.
Haixu TangLuddy School of Informatics, Computing, and Engineering, Indiana University, Bloomington, IN 47405, USA.

Funding

Secure and Privacy-preserving Genome-wide and Phenome-wide Association Studies via Intel Software Guard Extensions (SGX)R01HG010798 · NHGRI · TRUSTEES OF INDIANA UNIVERSITY · PI TANG, HAIXU, WANG, XIAOFENG · 2019 to 2022
$1.4M
Encryption methods and software for privacy-preserving analysis of biomedical dataU01EB023685 · NIBIB · TRUSTEES OF INDIANA UNIVERSITY · PI TANG, HAIXU, WANG, XIAOFENG · 2016 to 2018
$1.4M
NHGRI NIH HHS R01 HG010798NIBIB NIH HHS U01 EB023685
6 · The paper itself

Abstract

motivationThe generalized linear mixed model (GLMM) is an extension of the generalized linear model (GLM) in which the linear predictor takes random effects into account. Given its power of precisely modeling the mixed effects from multiple sources of random variations, the method has been widely used in biomedical computation, for instance in the genome-wide association studies (GWASs) that aim to detect genetic variance significantly associated with phenotypes such as human diseases. Collaborative GWAS on large cohorts of patients across multiple institutions is often impeded by the privacy concerns of sharing personal genomic and other health data. To address such concerns, we present in this paper a privacy-preserving Expectation-Maximization (EM) algorithm to build GLMM collaboratively when input data are distributed to multiple participating parties and cannot be transferred to a central server. We assume that the data are horizontally partitioned among participating parties: i.e. each party holds a subset of records (including observational values of fixed effect variables and their corresponding outcome), and for all records, the outcome is regulated by the same set of known fixed effects and random effects.

resultsOur collaborative EM algorithm is mathematically equivalent to the original EM algorithm commonly used in GLMM construction. The algorithm also runs efficiently when tested on simulated and real human genomic data, and thus can be practically used for privacy-preserving GLMM construction. We implemented the algorithm for collaborative GLMM (cGLMM) construction in R. The data communication was implemented using the rsocket package. AVAILABILITY AND IMPLEMENTATION: The software is released in open source at https://github.com/huthvincent/cGLMM. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

Genome-Wide Association StudyPrivacyGenomicsHumansLinear ModelsSoftware

Identifiers

PMID32657380
PMCPMC7355231

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.