Cargando…

An efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes

Clinical research networks (CRNs), made up of multiple healthcare systems each with patient data from several care sites, are beneficial for studying rare outcomes and increasing generalizability of results. While CRNs encourage sharing aggregate data across healthcare systems, individual systems wi...

Descripción completa

Detalles Bibliográficos
Autores principales: Edmondson, Mackenzie J., Luo, Chongliang, Duan, Rui, Maltenfort, Mitchell, Chen, Zhaoyi, Locke, Kenneth, Shults, Justine, Bian, Jiang, Ryan, Patrick B., Forrest, Christopher B., Chen, Yong
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8490431/
https://www.ncbi.nlm.nih.gov/pubmed/34608222
http://dx.doi.org/10.1038/s41598-021-99078-2
_version_ 1784578524254830592
author Edmondson, Mackenzie J.
Luo, Chongliang
Duan, Rui
Maltenfort, Mitchell
Chen, Zhaoyi
Locke, Kenneth
Shults, Justine
Bian, Jiang
Ryan, Patrick B.
Forrest, Christopher B.
Chen, Yong
author_facet Edmondson, Mackenzie J.
Luo, Chongliang
Duan, Rui
Maltenfort, Mitchell
Chen, Zhaoyi
Locke, Kenneth
Shults, Justine
Bian, Jiang
Ryan, Patrick B.
Forrest, Christopher B.
Chen, Yong
author_sort Edmondson, Mackenzie J.
collection PubMed
description Clinical research networks (CRNs), made up of multiple healthcare systems each with patient data from several care sites, are beneficial for studying rare outcomes and increasing generalizability of results. While CRNs encourage sharing aggregate data across healthcare systems, individual systems within CRNs often cannot share patient-level data due to privacy regulations, prohibiting multi-site regression which requires an analyst to access all individual patient data pooled together. Meta-analysis is commonly used to model data stored at multiple institutions within a CRN but can result in biased estimation, most notably in rare-event contexts. We present a communication-efficient, privacy-preserving algorithm for modeling multi-site zero-inflated count outcomes within a CRN. Our method, a one-shot distributed algorithm for performing hurdle regression (ODAH), models zero-inflated count data stored in multiple sites without sharing patient-level data across sites, resulting in estimates closely approximating those that would be obtained in a pooled patient-level data analysis. We evaluate our method through extensive simulations and two real-world data applications using electronic health records: examining risk factors associated with pediatric avoidable hospitalization and modeling serious adverse event frequency associated with a colorectal cancer therapy. In simulations, ODAH produced bias less than 0.1% across all settings explored while meta-analysis estimates exhibited bias up to 12.7%, with meta-analysis performing worst in settings with high zero-inflation or low event rates. Across both applied analyses, ODAH estimates had less than 10% bias for 18 of 20 coefficients estimated, while meta-analysis estimates exhibited substantially higher bias. Relative to existing methods for distributed data analysis, ODAH offers a highly accurate, computationally efficient method for modeling multi-site zero-inflated count data.
format Online
Article
Text
id pubmed-8490431
institution National Center for Biotechnology Information
language English
publishDate 2021
publisher Nature Publishing Group UK
record_format MEDLINE/PubMed
spelling pubmed-84904312021-10-05 An efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes Edmondson, Mackenzie J. Luo, Chongliang Duan, Rui Maltenfort, Mitchell Chen, Zhaoyi Locke, Kenneth Shults, Justine Bian, Jiang Ryan, Patrick B. Forrest, Christopher B. Chen, Yong Sci Rep Article Clinical research networks (CRNs), made up of multiple healthcare systems each with patient data from several care sites, are beneficial for studying rare outcomes and increasing generalizability of results. While CRNs encourage sharing aggregate data across healthcare systems, individual systems within CRNs often cannot share patient-level data due to privacy regulations, prohibiting multi-site regression which requires an analyst to access all individual patient data pooled together. Meta-analysis is commonly used to model data stored at multiple institutions within a CRN but can result in biased estimation, most notably in rare-event contexts. We present a communication-efficient, privacy-preserving algorithm for modeling multi-site zero-inflated count outcomes within a CRN. Our method, a one-shot distributed algorithm for performing hurdle regression (ODAH), models zero-inflated count data stored in multiple sites without sharing patient-level data across sites, resulting in estimates closely approximating those that would be obtained in a pooled patient-level data analysis. We evaluate our method through extensive simulations and two real-world data applications using electronic health records: examining risk factors associated with pediatric avoidable hospitalization and modeling serious adverse event frequency associated with a colorectal cancer therapy. In simulations, ODAH produced bias less than 0.1% across all settings explored while meta-analysis estimates exhibited bias up to 12.7%, with meta-analysis performing worst in settings with high zero-inflation or low event rates. Across both applied analyses, ODAH estimates had less than 10% bias for 18 of 20 coefficients estimated, while meta-analysis estimates exhibited substantially higher bias. Relative to existing methods for distributed data analysis, ODAH offers a highly accurate, computationally efficient method for modeling multi-site zero-inflated count data. Nature Publishing Group UK 2021-10-04 /pmc/articles/PMC8490431/ /pubmed/34608222 http://dx.doi.org/10.1038/s41598-021-99078-2 Text en © The Author(s) 2021 https://creativecommons.org/licenses/by/4.0/Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) .
spellingShingle Article
Edmondson, Mackenzie J.
Luo, Chongliang
Duan, Rui
Maltenfort, Mitchell
Chen, Zhaoyi
Locke, Kenneth
Shults, Justine
Bian, Jiang
Ryan, Patrick B.
Forrest, Christopher B.
Chen, Yong
An efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes
title An efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes
title_full An efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes
title_fullStr An efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes
title_full_unstemmed An efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes
title_short An efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes
title_sort efficient and accurate distributed learning algorithm for modeling multi-site zero-inflated count outcomes
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8490431/
https://www.ncbi.nlm.nih.gov/pubmed/34608222
http://dx.doi.org/10.1038/s41598-021-99078-2
work_keys_str_mv AT edmondsonmackenziej anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT luochongliang anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT duanrui anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT maltenfortmitchell anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT chenzhaoyi anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT lockekenneth anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT shultsjustine anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT bianjiang anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT ryanpatrickb anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT forrestchristopherb anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT chenyong anefficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT edmondsonmackenziej efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT luochongliang efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT duanrui efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT maltenfortmitchell efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT chenzhaoyi efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT lockekenneth efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT shultsjustine efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT bianjiang efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT ryanpatrickb efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT forrestchristopherb efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes
AT chenyong efficientandaccuratedistributedlearningalgorithmformodelingmultisitezeroinflatedcountoutcomes