{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:45:25Z","timestamp":1775069125110,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T00:00:00Z","timestamp":1698278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T00:00:00Z","timestamp":1698278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["826078"],"award-info":[{"award-number":["826078"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["031L0309A"],"award-info":[{"award-number":["031L0309A"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University Library of Southern Denmark"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Federated learning (FL) is emerging as a privacy-aware alternative to classical cloud-based machine learning. In FL, the sensitive data remains in data silos and only aggregated parameters are exchanged. Hospitals and research institutions which are not willing to share their data can join a federated study without breaching confidentiality. In addition to the extreme sensitivity of biomedical data, the high dimensionality poses a challenge in the context of federated genome-wide association studies (GWAS). In this article, we present a federated singular value decomposition algorithm, suitable for the privacy-related and computational requirements of GWAS. Notably, the algorithm has a transmission cost independent of the number of samples and is only weakly dependent on the number of features, because the singular vectors corresponding to the samples are never exchanged and the vectors associated with the features are only transmitted to an aggregator for a fixed number of iterations. Although motivated by GWAS, the algorithm is generically applicable for both horizontally and vertically partitioned data.\n<\/jats:p>","DOI":"10.1007\/s10618-023-00983-z","type":"journal-article","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:02:11Z","timestamp":1698303731000},"page":"938-975","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Federated singular value decomposition for high-dimensional data"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9172-3137","authenticated-orcid":false,"given":"Anne","family":"Hartebrodt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4490-5947","authenticated-orcid":false,"given":"Richard","family":"R\u00f6ttger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8651-750X","authenticated-orcid":false,"given":"David B.","family":"Blumenthal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,26]]},"reference":[{"key":"983_CR1","doi-asserted-by":"publisher","unstructured":"Al-Rubaie M, Wu PY, Chang JM, et\u00a0al (2017) Privacy-preserving PCA on horizontally-partitioned data. In: 2017 IEEE conference on dependable and secure computing, pp 280\u2013287. https:\/\/doi.org\/10.1109\/DESEC.2017.8073817","DOI":"10.1109\/DESEC.2017.8073817"},{"key":"983_CR2","unstructured":"Asi H, Duchi JC (2020) Instance-optimality in differential privacy via approximate inverse sensitivity mechanisms. In: Larochelle H, Ranzato M, Hadsell R, et\u00a0al (eds) Advances in neural information processing systems, vol\u00a033. Curran Associates, Inc., pp 14106\u201314117. https:\/\/proceedings.neurips.cc\/paper\/2020\/file\/a267f936e54d7c10a2bb70dbe6ad7a89-Paper.pdf"},{"key":"983_CR3","unstructured":"Balcan MF, Kanchanapally V, Liang Y et\u00a0al (2014) Improved distributed principal component analysis. In: Advances in neural information processing systems 4(January), pp 3113\u20133121. arXiv: org\/abs\/1408.5823"},{"issue":"June","key":"983_CR4","first-page":"284","volume":"49","author":"MF Balcan","year":"2016","unstructured":"Balcan MF, Du SS, Wang Y et al (2016) An improved gap-dependency analysis of the noisy power method. J Mach Learn Res 49(June):284\u2013309 (http:\/\/arxiv.org\/1602.07046)","journal-title":"J Mach Learn Res"},{"key":"983_CR5","unstructured":"Benz A, Chow A, Burkhardt D et\u00a0al (2022) Open problems: multimodal single-cell integration. https:\/\/kaggle.com\/competitions\/open-problems-multimodal"},{"key":"983_CR6","doi-asserted-by":"crossref","unstructured":"Chai D, Wang L, Zhang J et\u00a0al (2021) Practical lossless federated singular vector decomposition over billion-scale data. arXiv: org\/abs\/2105.08925","DOI":"10.1145\/3534678.3539402"},{"key":"983_CR7","first-page":"2905","volume":"14","author":"K Chaudhuri","year":"2013","unstructured":"Chaudhuri K, Sarwate AD, Sinha K (2013) A near-optimal algorithm for differentially-private principal components. J Mach Learn Res 14:2905\u20132943","journal-title":"J Mach Learn Res"},{"key":"983_CR8","unstructured":"Chen X, Lee JD, Li H et\u00a0al (2021) Distributed estimation for principal component analysis: a gap-free Approach. arXiv: org\/abs\/2004.02336"},{"issue":"6","key":"983_CR9","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1038\/nbt.4108","volume":"36","author":"H Cho","year":"2018","unstructured":"Cho H, Wu DJ, Berger B (2018) Secure genome-wide association analysis using multiparty computation. Nat Biotechnol 36(6):547\u2013551. https:\/\/doi.org\/10.1038\/nbt.4108","journal-title":"Nat Biotechnol"},{"key":"983_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure multiparty computation","author":"R Cramer","year":"2015","unstructured":"Cramer R, Damg\u00e5rd IB et al (2015) Secure multiparty computation. Cambridge University Press"},{"key":"983_CR11","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"issue":"3\u20134","key":"983_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2013","unstructured":"Dwork C, Roth A (2013) The algorithmic foundations of differential privacy. Found Trends Theor Comput Sci 9(3\u20134):211\u2013407. https:\/\/doi.org\/10.1561\/0400000042","journal-title":"Found Trends Theor Comput Sci"},{"key":"983_CR13","doi-asserted-by":"crossref","unstructured":"Froelicher D, Cho H, Edupalli M et\u00a0al (2023) Scalable and privacy-preserving federated principal component analysis. arXiv: org\/abs\/2304.00129","DOI":"10.1109\/SP46215.2023.10179350"},{"issue":"3","key":"983_CR14","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ajhg.2015.12.022","volume":"98","author":"KJ Galinsky","year":"2016","unstructured":"Galinsky KJ, Bhatia G, Loh PR et al (2016) Fast Principal-Component Analysis Reveals Convergent Evolution of ADH1B in Europe and East Asia. Am J Hum Genet 98(3):456\u2013472. https:\/\/doi.org\/10.1016\/j.ajhg.2015.12.022","journal-title":"Am J Hum Genet"},{"issue":"6","key":"983_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0218306","volume":"14","author":"HG Gauch","year":"2019","unstructured":"Gauch HG, Qian S, Piepho HP et al (2019) Consequences of PCA graphs, SNP codings, and PCA variants for elucidating population structure. PLoS ONE 14(6):1\u201326. https:\/\/doi.org\/10.1371\/journal.pone.0218306","journal-title":"PLoS ONE"},{"key":"983_CR16","first-page":"1","volume":"1","author":"A Gonen","year":"2018","unstructured":"Gonen A, Murphy K, Sch\u00f6lkopf B (2018) Smooth sensitivity based approach for differentially private principal component analysis. J Mach Learn Res 1:1\u201348","journal-title":"J Mach Learn Res"},{"key":"983_CR17","unstructured":"Grammenos A, Smith RM, Crowcroft J et\u00a0al (2020) Federated principal component analysis. In: Larochelle H, Ranzato M, Hadsell R et\u00a0al (eds) Advances in neural information processing systems, vol\u00a033. Curran Associates, Inc., pp 6453\u20136464. https:\/\/proceedings.neurips.cc\/paper\/2020\/file\/47a658229eb2368a99f1d032c8848542-Paper.pdf"},{"issue":"3","key":"983_CR18","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1016\/j.patcog.2011.09.002","volume":"45","author":"YF Guo","year":"2012","unstructured":"Guo YF, Lin X, Teng Z et al (2012) A covariance-free iterative algorithm for distributed principal component analysis on vertically partitioned data. Pattern Recognit 45(3):1211\u20131219. https:\/\/doi.org\/10.1016\/j.patcog.2011.09.002","journal-title":"Pattern Recognit"},{"key":"983_CR19","doi-asserted-by":"publisher","unstructured":"Hadri B, Ltaief H, Agullo E et\u00a0al (2010) Tile QR factorization with parallel panel processing for multicore architectures. In: 2010 IEEE international symposium on parallel distributed processing (IPDPS), pp 1\u201310. https:\/\/doi.org\/10.1109\/IPDPS.2010.5470443","DOI":"10.1109\/IPDPS.2010.5470443"},{"key":"983_CR20","unstructured":"Halko N, Martinsson PG, Shkolnisky Y et\u00a0al (2010) An algorithm for the principal component analysis of large data sets. arXiv: org\/abs\/1007.5510"},{"issue":"2","key":"983_CR21","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko N, Martinsson PG, Tropp JA (2011) Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev 53(2):217\u2013288. https:\/\/doi.org\/10.1137\/090771806","journal-title":"SIAM Rev"},{"key":"983_CR22","unstructured":"Hardt M, Price E (2013) The noisy power method: a meta algorithm with applications. arXiv arXiv: org\/abs\/1311.2495"},{"key":"983_CR23","doi-asserted-by":"publisher","DOI":"10.1145\/2827872","author":"FM Harper","year":"2015","unstructured":"Harper FM, Konstan JA (2015) The MovieLens datasets: history and context. ACM Trans Interact Intell Syst. https:\/\/doi.org\/10.1145\/2827872","journal-title":"ACM Trans Interact Intell Syst"},{"key":"983_CR24","doi-asserted-by":"crossref","unstructured":"Hartbrodt A (2022) Federated singular value decomposition for high dimensional data [AIMe lP0kqT]. https:\/\/aime.report\/lP0kqT","DOI":"10.1007\/s10618-023-00983-z"},{"key":"983_CR25","doi-asserted-by":"publisher","DOI":"10.1093\/bioadv\/vbac026","author":"A Hartebrodt","year":"2022","unstructured":"Hartebrodt A, R\u00f6ttger R (2022) Federated horizontally partitioned principal component analysis for biomedical applications. Bioinform Adv. https:\/\/doi.org\/10.1093\/bioadv\/vbac026","journal-title":"Bioinform Adv"},{"key":"983_CR26","doi-asserted-by":"publisher","unstructured":"Hartebrodt A, Nasirigerdeh R, Blumenthal DB et al (2021) Federated principal component analysis for genome-wide association studies. In: IEEE international conference on data mining (ICDM) 2021. https:\/\/doi.org\/10.1109\/ICDM51629.2021.00127","DOI":"10.1109\/ICDM51629.2021.00127"},{"key":"983_CR27","doi-asserted-by":"publisher","unstructured":"Hoemmen M (2011) A communication-avoiding, hybrid-parallel, rank-revealing orthogonalization method. In: 2011 IEEE international parallel distributed processing symposium, pp 966\u2013977. https:\/\/doi.org\/10.1109\/IPDPS.2011.93","DOI":"10.1109\/IPDPS.2011.93"},{"key":"983_CR28","doi-asserted-by":"publisher","unstructured":"Imtiaz H, Sarwate AD (2018) Differentially private distributed principal component analysis. In: 2018 IEEE international conference on acoustics, speech and signal processing (ICASSP). IEEE, pp 2206\u20132210. https:\/\/doi.org\/10.1109\/ICASSP.2018.8462519","DOI":"10.1109\/ICASSP.2018.8462519"},{"key":"983_CR29","unstructured":"Imtiaz H, Mohammadi J, Sarwate AD (2019) Distributed differentially private computation of functions with correlated noise, pp 1\u201340. arXiv: org\/abs\/1904.10059"},{"key":"983_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/b98835","volume-title":"Principal component analysis","author":"IT Joliffe","year":"2002","unstructured":"Joliffe IT (2002) Principal component analysis. Springer. https:\/\/doi.org\/10.1007\/b98835"},{"issue":"1\u20132","key":"983_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000083","volume":"14","author":"P Kairouz","year":"2021","unstructured":"Kairouz P, McMahan HB, Avent B et al (2021) Advances and open problems in federated learning. Found Trends Mach Learn 14(1\u20132):1\u2013210. https:\/\/doi.org\/10.1561\/2200000083","journal-title":"Found Trends Mach Learn"},{"key":"983_CR32","doi-asserted-by":"publisher","DOI":"10.4324\/9781315799476-12","author":"H Kargupta","year":"2001","unstructured":"Kargupta H, Huang W, Sivakumar K et al (2001) Distributed clustering using collective principal component analysis. Knowl Inf Syst. https:\/\/doi.org\/10.4324\/9781315799476-12","journal-title":"Knowl Inf Syst"},{"key":"983_CR33","unstructured":"LeCun Y, Cortes C, Burges CJ (2005) MNNIST database of handwritten digits. http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"key":"983_CR34","unstructured":"Lei Q, Zhong K, Dhillon IS (2016) Coordinate-wise Power Method. In: Lee D, Sugiyama M, Luxburg U, et\u00a0al (eds) Advances in neural information processing systems, vol\u00a029. Curran Associates, Inc., pp 2064\u20132072, https:\/\/proceedings.neurips.cc\/paper\/2016\/file\/8b4066554730ddfaa0266346bdc1b202-Paper.pdf"},{"key":"983_CR35","unstructured":"Li X, Wang S, Chen K et\u00a0al (2021) Communication-efficient distributed SVD via local power iterations. arXiv: org\/abs\/2002.08014, [cs, math, stat]"},{"issue":"1","key":"983_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-016-0965-1","volume":"17","author":"Y Li","year":"2016","unstructured":"Li Y, Byun J, Cai G et al (2016) FastPop: a rapid principal component derived method to infer intercontinental ancestry using genetic data. BMC Bioinform 17(1):1\u20138. https:\/\/doi.org\/10.1186\/s12859-016-0965-1","journal-title":"BMC Bioinform"},{"key":"983_CR37","unstructured":"Liu B, Tang Q (2019) Privacy-preserving decentralised singular value decomposition. https:\/\/eprint.iacr.org\/2019\/1346"},{"key":"983_CR38","unstructured":"Liu Y, Chen C, Zheng L, et\u00a0al (2020) Privacy preserving PCA for multiparty modeling. arXiv: org\/abs\/2002.02091"},{"key":"983_CR39","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0013443","volume":"5","author":"ER Londin","year":"2010","unstructured":"Londin ER, Keller MA, Maista C et al (2010) CoAIMs: a cost-effective panel of ancestry informative markers for determining continental origins. PLoS ONE 5:e13443. https:\/\/doi.org\/10.1371\/journal.pone.0013443","journal-title":"PLoS ONE"},{"key":"983_CR40","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-021-01241-0","author":"J Matschinske","year":"2021","unstructured":"Matschinske J, Alcaraz N, Benis A et al (2021) The AIMe registry for artificial intelligence in biomedical research. Nat Methods. https:\/\/doi.org\/10.1038\/s41592-021-01241-0","journal-title":"Nat Methods"},{"key":"983_CR41","doi-asserted-by":"publisher","first-page":"e42621","DOI":"10.2196\/42621","volume":"25","author":"JO Matschinske","year":"2023","unstructured":"Matschinske JO, Sp\u00e4th J, Bakhtiari M et al (2023) The FeatureCloud platform for federated learning in biomedicine: unified approach. J Med Internet Res 25:e42621","journal-title":"J Med Internet Res"},{"key":"983_CR42","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.future.2020.10.007","volume":"115","author":"V Mothukuri","year":"2021","unstructured":"Mothukuri V, Parizi RM, Pouriyeh S et al (2021) A survey on security and privacy of federated learning. Future Gener Comput Syst 115:619\u2013640. https:\/\/doi.org\/10.1016\/j.future.2020.10.007","journal-title":"Future Gener Comput Syst"},{"key":"983_CR43","unstructured":"Musco C, Musco C (2015) Randomized block Krylov methods for stronger and faster approximate singular value decomposition. In: Cortes C, Lawrence N, Lee D et\u00a0al (eds) Advances in neural information processing systems, vol\u00a028. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper\/2015\/file\/1efa39bcaec6f3900149160693694536-Paper.pdf"},{"key":"983_CR44","doi-asserted-by":"publisher","unstructured":"Nasirigerdeh R, Torkzadehmahani R, Matschinske J et al (2020) sPLINK: a federated, privacy-preserving tool as a robust alternative to meta-analysis in genome-wide association studies. https:\/\/doi.org\/10.1101\/2020.06.05.136382","DOI":"10.1101\/2020.06.05.136382"},{"key":"983_CR45","doi-asserted-by":"publisher","unstructured":"Nasirigerdeh R, Torkzadehmahani R, Baumbach J et\u00a0al (2021) On the privacy of federated pipelines. In: International ACM SIGIR conference on research and development in information retrieval 2021. ACM, New York, p\u00a05. https:\/\/doi.org\/10.1145\/3404835.3462996","DOI":"10.1145\/3404835.3462996"},{"issue":"3","key":"983_CR46","first-page":"129","volume":"4","author":"MA Pathak","year":"2011","unstructured":"Pathak MA, Raj B (2011) Efficient protocols for principal eigenvector computation over private data. Trans Data Priv 4(3):129\u2013146","journal-title":"Trans Data Priv"},{"issue":"8","key":"983_CR47","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1038\/ng1847","volume":"38","author":"AL Price","year":"2006","unstructured":"Price AL, Patterson NJ, Plenge RM et al (2006) Principal components analysis corrects for stratification in genome-wide association studies. Nat Genet 38(8):904\u2013909. https:\/\/doi.org\/10.1038\/ng1847","journal-title":"Nat Genet"},{"key":"983_CR48","doi-asserted-by":"publisher","unstructured":"Qi H, Wang TW, Birdwell JD (2003) Global principal component analysis for dimensionality reduction in distributed data mining. In: Statistical data mining and knowledge discovery. Chapman and Hall\/CRC, pp 323\u2013338. https:\/\/doi.org\/10.1201\/9780203497159.ch19","DOI":"10.1201\/9780203497159.ch19"},{"key":"983_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59650-1_8","volume-title":"A review of distributed data models for learning","author":"MA Rodr\u00edguez","year":"2017","unstructured":"Rodr\u00edguez MA, Fern\u00e1ndez A, Peregr\u00edn A et al (2017) A review of distributed data models for learning. Springer, Cham"},{"key":"983_CR50","unstructured":"Ryffel T, Trask A, Dahl M et\u00a0al (2018) A generic framework for privacy preserving deep learning. arXiv: org\/abs\/1811.04017"},{"key":"983_CR51","doi-asserted-by":"publisher","unstructured":"Saad Y (2011) Numerical methods for large eigenvalue problems. Classics in Applied Mathematics, Society for Industrial and Applied Mathematics and Applied Mathematics. https:\/\/doi.org\/10.1137\/1.9781611970739","DOI":"10.1137\/1.9781611970739"},{"key":"983_CR52","doi-asserted-by":"publisher","unstructured":"Sanchez-Fernandez A, Fuente M, Sainz-Palmero G (2015) Fault detection in wastewater treatment plants using distributed PCA methods. In: 2015 IEEE 20th conference on emerging technologies & factory automation (ETFA). IEEE, pp 1\u20137. https:\/\/doi.org\/10.1109\/ETFA.2015.7301504","DOI":"10.1109\/ETFA.2015.7301504"},{"key":"983_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13634-016-0322-6","volume":"1","author":"O Sluciak","year":"2016","unstructured":"Sluciak O, Strakov\u00e1 H, Rupp M et al (2016) Distributed Gram\u2013Schmidt orthogonalization with simultaneous elements refinement. EURASIP J Adv Signal Process 1:1\u201313. https:\/\/doi.org\/10.1186\/s13634-016-0322-6","journal-title":"EURASIP J Adv Signal Process"},{"key":"983_CR54","doi-asserted-by":"publisher","unstructured":"Steed A, MFD\u00a0de Oliveira (2010) More than two. Network graphics, pp 125\u2013168. https:\/\/doi.org\/10.1016\/B978-0-12-374423-4.00004-5","DOI":"10.1016\/B978-0-12-374423-4.00004-5"},{"key":"983_CR55","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-31464-3_24","volume-title":"Parallel processing and applied mathematics","author":"H Strakov\u00e1","year":"2012","unstructured":"Strakov\u00e1 H, Gansterer WN, Zemen T (2012) Distributed QR factorization based on randomized algorithms. In: Wyrzykowski R, Dongarra J, Karczewski K et al (eds) Parallel processing and applied mathematics. Springer, Berlin, Heidelberg, pp 235\u2013244"},{"issue":"8","key":"983_CR56","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1038\/s41576-019-0127-1","volume":"20","author":"V Tam","year":"2019","unstructured":"Tam V, Patel N, Turcotte M et al (2019) Benefits and limitations of genome-wide association studies. Nat Rev Genet 20(8):467\u2013484. https:\/\/doi.org\/10.1038\/s41576-019-0127-1","journal-title":"Nat Rev Genet"},{"key":"983_CR57","doi-asserted-by":"publisher","unstructured":"The 1000 Genomes Consortium, Auton, A (2015) A global reference for human genetic variation. Nature 526(7571):68\u201374. https:\/\/doi.org\/10.1038\/nature15393","DOI":"10.1038\/nature15393"},{"issue":"1","key":"983_CR58","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.ajhg.2017.06.005","volume":"101","author":"PM Visscher","year":"2017","unstructured":"Visscher PM, Wray NR, Zhang Q et al (2017) 10 years of GWAS discovery: biology, function, and translation. Am J Hum Genet 101(1):5\u201322. https:\/\/doi.org\/10.1016\/j.ajhg.2017.06.005","journal-title":"Am J Hum Genet"},{"key":"983_CR59","doi-asserted-by":"publisher","unstructured":"Wang S, Chang JM (2019) Differentially private principal component analysis over horizontally partitioned data. In: DSC 2018\u20132018 IEEE conference on dependable and secure computing, pp 1\u20138. https:\/\/doi.org\/10.1109\/DESEC.2018.8625131","DOI":"10.1109\/DESEC.2018.8625131"},{"key":"983_CR60","unstructured":"Wang S, Zhang Z, Zhang T (2015) Improved analyses of the randomized power method and block Lanczos method. arXiv arXiv: org\/abs\/1508.06429"},{"issue":"8","key":"983_CR61","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/JPROC.2018.2846568","volume":"106","author":"SX Wu","year":"2018","unstructured":"Wu SX, Wai HT, Li L et al (2018) A review of distributed algorithms for principal component analysis. Proc IEEE 106(8):1321\u20131340. https:\/\/doi.org\/10.1109\/JPROC.2018.2846568","journal-title":"Proc IEEE"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00983-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-023-00983-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00983-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T09:11:45Z","timestamp":1714813905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-023-00983-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,26]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["983"],"URL":"https:\/\/doi.org\/10.1007\/s10618-023-00983-z","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,26]]},"assertion":[{"value":"24 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}