Padé approximant meets federated learning: A nearly lossless, one-shot algorithm for evidence synthesis in distributed research networks with rare outcomes.
| Publicado en: | Journal of Biomedical Informatics Vol. 145 |
|---|---|
| Autores principales: | , , , , , , |
| Formato: | Journal Article |
| Publicado: |
Academic Press Inc.
Sep2023
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=171851109&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 171851109 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 15320464 OMB jtl: Journal of Biomedical Informatics issn: 15320464 maglogo: N pubinfo: dt: Sep2023 vid: 145 pid: 735 pub: Academic Press Inc. place: Burlington, Massachusetts artinfo: ui: 171851109 10.1016/j.jbi.2023.104476 171851109 ppct: 1 formats: tig: atl: Padé approximant meets federated learning: A nearly lossless, one-shot algorithm for evidence synthesis in distributed research networks with rare outcomes. aug: au: Wu, Qiong Schuemie, Martijn J. Suchard, Marc A. Ryan, Patrick Hripcsak, George M. Rohde, Charles A. Chen, Yong affil: Department of Biostatistics, Epidemiology and Informatics, Perelman School of Medicine, University of Pennsylvania, Philadelphia, PA, United States of America sug: pubtype: Academic Journal doctype: Journal Article ougenre: Article ab: language: English refInfo: holdings: @attributes: islocal: N |
|---|