{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:54:36Z","timestamp":1767142476122,"version":"build-2238731810"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T00:00:00Z","timestamp":1694131200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T00:00:00Z","timestamp":1694131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"U.S. Department of Energy National Nuclear Security Administration","award":["DE-AC52-06NA25396"],"award-info":[{"award-number":["DE-AC52-06NA25396"]}]},{"name":"LANL LDRD","award":["20190020DR"],"award-info":[{"award-number":["20190020DR"]}]},{"name":"LANL LDRD","award":["20190020DR"],"award-info":[{"award-number":["20190020DR"]}]},{"name":"LANL LDRD","award":["20190020DR"],"award-info":[{"award-number":["20190020DR"]}]},{"name":"LANL LDRD","award":["20190020DR"],"award-info":[{"award-number":["20190020DR"]}]},{"name":"LANL LDRD","award":["20190020DR"],"award-info":[{"award-number":["20190020DR"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We propose an efficient distributed out-of-memory implementation of the non-negative matrix factorization (NMF) algorithm for heterogeneous high-performance-computing systems. The proposed implementation is based on prior work on NMFk, which can perform automatic model selection and extract latent variables and patterns from data. In this work, we extend NMFk by adding support for dense and sparse matrix operation on multi-node, multi-GPU systems. The resulting algorithm is optimized for out-of-memory problems where the memory required to factorize a given matrix is greater than the available GPU memory. Memory complexity is reduced by batching\/tiling strategies, and sparse and dense matrix operations are significantly accelerated with GPU cores (or tensor cores when available). Input\/output latency associated with batch copies between host and device is hidden using CUDA streams to overlap data transfers and compute asynchronously, and latency associated with collective communications (both intra-node and inter-node) is reduced using optimized NVIDIA Collective Communication Library (NCCL) based communicators. Benchmark results show significant improvement, from 32X to 76x speedup, with the new implementation using GPUs over the CPU-based NMFk. Good weak scaling was demonstrated on up to 4096 multi-GPU cluster nodes with approximately 25,000 GPUs when decomposing a dense 340 Terabyte-size matrix and an 11 Exabyte-size sparse matrix of density\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$10^{-6}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mn>10<\/mml:mn>\n                            <mml:mrow>\n                              <mml:mo>-<\/mml:mo>\n                              <mml:mn>6<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    .\n                  <\/jats:p>","DOI":"10.1007\/s11227-023-05587-4","type":"journal-article","created":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T07:02:24Z","timestamp":1694156544000},"page":"3970-3999","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Distributed out-of-memory NMF on CPU\/GPU architectures"],"prefix":"10.1007","volume":"80","author":[{"given":"Ismael","family":"Boureima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manish","family":"Bhattarai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maksim","family":"Eren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Skau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Eidenbenz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boian","family":"Alexandrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,8]]},"reference":[{"issue":"6755","key":"5587_CR1","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791","journal-title":"Nature"},{"key":"5587_CR2","doi-asserted-by":"crossref","unstructured":"Cichocki A, Zdunek R, Phan AH, Amari S-i (2009) Nonnegative matrix and tensor factorizations: applications to exploratory multi-way data analysis and blind source separation","DOI":"10.1002\/9780470747278"},{"key":"5587_CR3","unstructured":"Everett B (2013) An introduction to latent variable models"},{"issue":"1","key":"5587_CR4","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.celrep.2012.12.008","volume":"3","author":"LB Alexandrov","year":"2013","unstructured":"Alexandrov LB, Nik-Zainal S, Wedge DC, Campbell PJ, Stratton MR (2013) Deciphering signatures of mutational processes operative in human cancer. Cell Rep 3(1):246\u2013259","journal-title":"Cell Rep"},{"key":"5587_CR5","unstructured":"Alexandrov BS, Alexandrov LB, Iliev F, Stanev VG, Vesselinov V (2020) Source identification by non-negative matrix factorization combined with semi-supervised clustering. Google Patents. US Patent 10,776,718"},{"key":"5587_CR6","doi-asserted-by":"crossref","unstructured":"Chennupati G, Vangara R, Skau E, Djidjev H, Alexandrov B (2020) Distributed non-negative matrix factorization with determination of the number of latent features. The Journal of Supercomputing, 1\u201331","DOI":"10.1007\/s11227-020-03181-6"},{"key":"5587_CR7","doi-asserted-by":"publisher","unstructured":"Bhattarai M, Nebgen B, Skau E, Eren M, Chennupati G, Vangara R, Djidjev H, Patchett J, Ahrens J, ALexandrov B (2021) pyDNMFk: python distributed non negative matrix factorization. GitHub. https:\/\/doi.org\/10.5281\/zenodo.4722448","DOI":"10.5281\/zenodo.4722448"},{"key":"5587_CR8","doi-asserted-by":"crossref","unstructured":"Vangara R, Bhattarai M, Skau E, Chennupati G, Djidjev H, Tierney T et al (2021) Finding the number of latent topics with semantic non-negative matrix factorization. IEEE Access, pp 117217\u2013117231","DOI":"10.1109\/ACCESS.2021.3106879"},{"issue":"7463","key":"5587_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1038\/nature12477","volume":"500","author":"LB Alexandrov","year":"2013","unstructured":"Alexandrov LB, Nik-Zainal S, Wedge DC, Aparicio SA, Behjati S, Biankin AV, Bignell GR, Bolli N, Borg A, B\u00f8rresen-Dale A-L et al (2013) Signatures of mutational processes in human cancer. Nature 500(7463):415","journal-title":"Nature"},{"issue":"7793","key":"5587_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1038\/s41586-020-1943-3","volume":"578","author":"LB Alexandrov","year":"2020","unstructured":"Alexandrov LB, Kim J, Haradhvala NJ, Huang MN, Ng AWT, Wu Y, Boot A, Covington KR, Gordenin DA, Bergstrom EN et al (2020) The repertoire of mutational signatures in human cancer. Nature 578(7793):94\u2013101","journal-title":"Nature"},{"key":"5587_CR11","doi-asserted-by":"crossref","unstructured":"Vangara R, Skau E, Chennupati G, Djidjev H, Tierney T, Smith JP, Bhattarai M, Stanev VG, Alexandrov BS (2020) Semantic nonnegative matrix factorization with automatic model determination for topic modeling, pp 328\u2013335. IEEE","DOI":"10.1109\/ICMLA51294.2020.00060"},{"key":"5587_CR12","doi-asserted-by":"crossref","unstructured":"Bhattarai M, Chennupati G, Skau E, Vangara R, Djidjev H, Alexandrov BS (2020)Distributed non-negative tensor train decomposition. In: 2020 IEEE High Performance Extreme Computing Conference (HPEC), pp 1\u201310. IEEE","DOI":"10.1109\/HPEC43674.2020.9286234"},{"issue":"4","key":"5587_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1002\/sam.11407","volume":"12","author":"BS Alexandrov","year":"2019","unstructured":"Alexandrov BS, Stanev VG, Vesselinov VV, Rasmussen K\u00d8 (2019) Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers. Stat Anal Data Min ASA Data Sci J 12(4):302\u2013310","journal-title":"Stat Anal Data Min ASA Data Sci J"},{"key":"5587_CR14","doi-asserted-by":"publisher","unstructured":"Pulido J, Patchett J, Bhattarai M, Alexandrov B, Ahrens J (2021) Selection of optimal salient time steps by non-negative tucker tensor decomposition. In: Agus M, Garth C, Kerren A (eds) EuroVis 2021\u2014short papers. The Eurographics Association. https:\/\/doi.org\/10.2312\/evs.20211055","DOI":"10.2312\/evs.20211055"},{"key":"5587_CR15","doi-asserted-by":"crossref","unstructured":"Bhattarai M, Kharat N, Skau E, Nebgen B, Djidjev H, Rajopadhye S, Smith JP, Alexandrov B (2022) Distributed non-negative rescal with automatic model selection for exascale data. arXiv preprint arXiv:2202.09512","DOI":"10.2139\/ssrn.4068363"},{"key":"5587_CR16","doi-asserted-by":"publisher","unstructured":"Bhattarai M, Kharat N, Skau E, Truong D, Eren M, Rajopadhye S, Djidjev H, Alexandrov B pyDRESCALk: python distributed non negative RESCAL decomposition with determination of latent features. https:\/\/doi.org\/10.5281\/zenodo.5758446","DOI":"10.5281\/zenodo.5758446"},{"key":"5587_CR17","doi-asserted-by":"crossref","unstructured":"Eren ME, Moore JS, Skau E, Moore E, Bhattarai M, Chennupati G, Alexandrov BS (2022) General-purpose unsupervised cyber anomaly detection via non-negative tensor factorization. Research and practice, digital threats","DOI":"10.1145\/3519602"},{"key":"5587_CR18","unstructured":"Eren ME, Richards LE, Bhattarai M, Yus R, Nicholas C, Alexandrov BS (2022) Fedsplit: One-shot federated recommendation system based on non-negative joint matrix factorization and knowledge distillation. arXiv preprint arXiv:2205.02359"},{"key":"5587_CR19","doi-asserted-by":"crossref","unstructured":"Eren ME, Solovyev N, Bhattarai M, Rasmussen K, Nicholas C, Alexandrov BS (2022) Senmfk-split: Large corpora topic modeling by semantic non-negative matrix factorization with automatic model selection. arXiv preprint arXiv:2208.09942","DOI":"10.1145\/3558100.3563844"},{"key":"5587_CR20","doi-asserted-by":"crossref","unstructured":"F\u00e9votte C, Cemgil AT (2009) Nonnegative matrix factorizations as probabilistic inference in composite models. In: 2009 17th European Signal Processing Conference, pp 1913\u20131917. IEEE","DOI":"10.1109\/SIU.2009.5136487"},{"key":"5587_CR21","unstructured":"Phan AH, Cichocki A (2008) Multi-way nonnegative tensor factorization using fast hierarchical alternating least squares algorithm (HALS). In: Proc. of The 2008 international symposium on nonlinear theory and its applications"},{"key":"5587_CR22","doi-asserted-by":"crossref","unstructured":"Kim J, Park H (2012) Fast nonnegative tensor factorization with an active-set-like method, pp 311\u2013326","DOI":"10.1007\/978-1-4471-2437-5_16"},{"issue":"2","key":"5587_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10898-013-0035-4","volume":"58","author":"J Kim","year":"2014","unstructured":"Kim J, He Y, Park H (2014) Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework. J Global Optim 58(2):285\u2013319","journal-title":"J Global Optim"},{"key":"5587_CR24","unstructured":"Battenberg E, Wessel D (2009) Accelerating non-negative matrix factorization for audio source separation on multi-core and many-core architectures. In: ISMIR, pp 501\u2013506"},{"key":"5587_CR25","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.parco.2015.03.002","volume":"47","author":"JP Fairbanks","year":"2015","unstructured":"Fairbanks JP, Kannan R, Park H, Bader DA (2015) Behavioral clusters in dynamic graphs. Parallel Comput 47:38\u201350","journal-title":"Parallel Comput"},{"key":"5587_CR26","doi-asserted-by":"crossref","unstructured":"Moon GE, Ellis JA, Sukumaran-Rajam A, Parthasarathy S, Sadayappan P (2020) ALO-NMF: Accelerated locality-optimized non-negative matrix factorization. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 1758\u20131767","DOI":"10.1145\/3394486.3403227"},{"issue":"3","key":"5587_CR27","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/18M1210691","volume":"41","author":"ET Phipps","year":"2019","unstructured":"Phipps ET, Kolda TG (2019) Software for sparse tensor decomposition on emerging computing architectures. SIAM J Sci Comput 41(3):269\u2013290","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"5587_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-015-0485-4","volume":"16","author":"E Mej\u00eda-Roa","year":"2015","unstructured":"Mej\u00eda-Roa E, Tabas-Madrid D, Setoain J, Garc\u00eda C, Tirado F, Pascual-Montano A (2015) NMF-mGPU: non-negative matrix factorization on multi-GPU systems. BMC Bioinf 16(1):1\u201312","journal-title":"BMC Bioinf"},{"key":"5587_CR29","doi-asserted-by":"crossref","unstructured":"Lopes N, Ribeiro B (2010) Non-negative matrix factorization implementation using graphic processing units. In: International Conference on Intelligent Data Engineering and Automated Learning, pp 275\u2013283. Springer","DOI":"10.1007\/978-3-642-15381-5_34"},{"issue":"8","key":"5587_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3016078.2851152","volume":"51","author":"R Kannan","year":"2016","unstructured":"Kannan R, Ballard G, Park H (2016) A high-performance parallel algorithm for nonnegative matrix factorization. ACM SIGPLAN Not 51(8):1\u201311","journal-title":"ACM SIGPLAN Not"},{"issue":"2","key":"5587_CR31","doi-asserted-by":"publisher","first-page":"382","DOI":"10.32614\/RJ-2016-053","volume":"8","author":"S Koitka","year":"2016","unstructured":"Koitka S, Friedrich CM (2016) nmfgpu4R: GPU-Accelerated Computation of the Non-Negative Matrix Factorization (NMF) Using CUDA Capable Hardware. R J 8(2):382","journal-title":"R J"},{"key":"5587_CR32","doi-asserted-by":"crossref","unstructured":"Tang B, Kang L, Zhang L, Guo F, He H (2021) collaborative filtering recommendation using nonnegative matrix factorization in GPU-accelerated spark platform. Scientific Programming 2021","DOI":"10.1155\/2021\/8841133"},{"issue":"3","key":"5587_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3432185","volume":"47","author":"S Eswar","year":"2021","unstructured":"Eswar S, Hayashi K, Ballard G, Kannan R, Matheson MA, Park H (2021) PLANC: parallel low-rank approximation with nonnegativity constraints. ACM Trans Math Softw 47(3):1\u201337","journal-title":"ACM Trans Math Softw"},{"key":"5587_CR34","doi-asserted-by":"crossref","unstructured":"Boureima I, Bhattarai M, Eren ME, Solovyev N, Djidjev H, Alexandrov BS (2022) Distributed out-of-memory SVD on CPU\/GPU architectures. arXiv preprint arXiv:2208.08410","DOI":"10.1109\/HPEC55821.2022.9926288"},{"key":"5587_CR35","unstructured":"Okuta R, Unno Y, Nishino D, Hido S, Loomis C (2017) Cupy: A NumPy-compatible library for NVIDIA GPU calculations. In: Proceedings of Workshop on Machine Learning Systems (LearningSys) in the Thirty-First Annual Conference on Neural Information Processing Systems (NIPS). http:\/\/learningsys.org\/nips17\/assets\/papers\/paper_16.pdf"},{"issue":"7825","key":"5587_CR36","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"...Harris CR, Millman KJ, van der Walt SJ, Gommers R, Virtanen P, Cournapeau D, Wieser E, Taylor J, Berg S, Smith NJ, Kern R, Picus M, Hoyer S, van Kerkwijk MH, Brett M, Haldane A, del R\u00edo JF, Wiebe M, Peterson P, G\u00e9rard-Marchant P, Sheppard K, Reddy T, Weckesser W, Abbasi H, Gohlke C, Oliphant TE (2020) Array programming with NumPy. Nature 585(7825):357\u2013362. https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nature"},{"issue":"4","key":"5587_CR37","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/MCSE.2021.3083216","volume":"23","author":"L Dalcin","year":"2021","unstructured":"Dalcin L, Fang Y-LL (2021) mpi4py: Status update after 12 years of development. Comput Sci Eng 23(4):47\u201354","journal-title":"Comput Sci Eng"},{"key":"5587_CR38","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"...Virtanen P, Gommers R, Oliphant TE, Haberland M, Reddy T, Cournapeau D, Burovski E, Peterson P, Weckesser W, Bright J, van der Walt SJ, Brett M, Wilson J, Millman KJ, Mayorov N, Nelson ARJ, Jones E, Kern R, Larson E, Carey CJ, Polat \u0130, Feng Y, Moore EW, VanderPlas J, Laxalde D, Perktold J, Cimrman R, Henriksen I, Quintero EA, Harris CR, Archibald AM, Ribeiro AH, Pedregosa F, van Mulbregt P (2020) SciPy 1.0 contributors: SciPy 1.0: fundamental algorithms for scientific computing in python. Nat Methods 17:261\u2013272. https:\/\/doi.org\/10.1038\/s41592-019-0686-2","journal-title":"Nat Methods"},{"key":"5587_CR39","doi-asserted-by":"crossref","unstructured":"Awan AA, Hamidouche K, Venkatesh A, Panda DK (2016) Efficient large message broadcast using NCCL and CUDA-aware MPI for deep learning. In: Proceedings of the 23rd European MPI Users\u2019 Group Meeting, pp 15\u201322","DOI":"10.1145\/2966884.2966912"},{"issue":"1","key":"5587_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40504-021-00118-6","volume":"17","author":"E Quigley","year":"2021","unstructured":"Quigley E, Holme I, Doyle DM, Ho AK, Ambrose E, Kirkwood K, Doyle G (2021) data is the new oil: citizen science and informed consent in an era of researchers handling of an economically valuable resource. Life Sci Soc Policy 17(1):1\u201313","journal-title":"Life Sci Soc Policy"},{"key":"5587_CR41","unstructured":"Hickey A (2019) Zettabytes of data hog up space and resources"},{"key":"5587_CR42","volume-title":"Application of Big Data for national security: a practitioner\u2019s guide to emerging technologies","author":"B Akhgar","year":"2015","unstructured":"Akhgar B, Saathoff GB, Arabnia HR, Hill R, Staniforth A, Bayerl PS (2015) Application of Big Data for national security: a practitioner\u2019s guide to emerging technologies. Butterworth-Heinemann, Oxford"},{"issue":"11","key":"5587_CR43","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1107\/S0907444912038152","volume":"68","author":"RG Sierra","year":"2012","unstructured":"Sierra RG, Laksmono H, Kern J, Tran R, Hattne J, Alonso-Mori R, Lassalle-Kaiser B, Gl\u00f6ckner C, Hellmich J, Schafer DW et al (2012) Nanoflow electrospinning serial femtosecond crystallography. Acta Crystallogr D Biol Crystallogr 68(11):1584\u20131587","journal-title":"Acta Crystallogr D Biol Crystallogr"},{"key":"5587_CR44","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1007\/s11837-013-0699-8","volume":"65","author":"RL Sandberg","year":"2013","unstructured":"Sandberg RL, Huang Z, Xu R, Rodriguez JA, Miao J (2013) Studies of materials at the nanometer scale using coherent x-ray diffraction imaging. JOM 65:1208\u20131220","journal-title":"JOM"},{"issue":"4","key":"5587_CR45","doi-asserted-by":"publisher","first-page":"079","DOI":"10.21468\/SciPostPhys.14.4.079","volume":"14","author":"A Butter","year":"2023","unstructured":"Butter A, Plehn T, Schumann S, Badger S, Caron S, Cranmer K, Di Bello FA, Dreyer E, Forte S, Ganguly S et al (2023) Machine learning and LHC event generation. SciPost Phys 14(4):079","journal-title":"SciPost Phys"},{"issue":"24","key":"5587_CR46","doi-asserted-by":"publisher","first-page":"241727","DOI":"10.1063\/1.5005095","volume":"148","author":"K Gubaev","year":"2018","unstructured":"Gubaev K, Podryabinkin EV, Shapeev AV (2018) Machine learning of molecular properties: locality and active learning. J Cheml Phys 148(24):241727","journal-title":"J Cheml Phys"},{"issue":"1","key":"5587_CR47","doi-asserted-by":"publisher","first-page":"8512","DOI":"10.1038\/s41598-017-08455-3","volume":"7","author":"I Kruglov","year":"2017","unstructured":"Kruglov I, Sergeev O, Yanilkin A, Oganov AR (2017) Energy-free machine learning force field for aluminum. Sci Rep 7(1):8512","journal-title":"Sci Rep"},{"key":"5587_CR48","unstructured":"Haghighatlari M, Heidar-Zadeh F, Hirn M, Hoja J, Isayev O, Kondor R, Li L, Li Y, Martyna G, Meila M et al (2017) IPAM program on machine learning & many-particle systems-recent progress and open problems"},{"key":"5587_CR49","unstructured":"Messina P, Lee S (2016) The us exascale computing project. In: Proc. ACM\/IEEE conf. supercomputing (birds a feather)"},{"key":"5587_CR50","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ress.2019.03.002","volume":"188","author":"J Zhang","year":"2019","unstructured":"Zhang J, Xiao M, Gao L (2019) An active learning reliability method combining kriging constructed with exploration and exploitation of failure region and subset simulation. Reliab Eng Syst Saf 188:90\u2013102","journal-title":"Reliab Eng Syst Saf"},{"issue":"3","key":"5587_CR51","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1111\/insr.12176","volume":"84","author":"B Franke","year":"2016","unstructured":"Franke B, Plante J-F, Roscher R, E-sA Lee, Smyth C, Hatefi A, Chen F, Gil E, Schwing A, Selvitella A et al (2016) Statistical inference, learning and models in big data. Int Stat Rev 84(3):371\u2013389","journal-title":"Int Stat Rev"}],"updated-by":[{"DOI":"10.1007\/s11227-023-05675-5","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T00:00:00Z","timestamp":1695859200000}}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05587-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05587-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05587-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T06:17:12Z","timestamp":1705904232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05587-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,8]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["5587"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05587-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,8]]},"assertion":[{"value":"9 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2023","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11227-023-05675-5","URL":"https:\/\/doi.org\/10.1007\/s11227-023-05675-5","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}