{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T01:27:41Z","timestamp":1774056461695,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T00:00:00Z","timestamp":1578614400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T00:00:00Z","timestamp":1578614400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s11222-019-09919-4","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T16:02:59Z","timestamp":1578672179000},"page":"731-748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Mini-batch learning of exponential family finite mixture models"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9958-432X","authenticated-orcid":false,"given":"Hien D.","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florence","family":"Forbes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey J.","family":"McLachlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,10]]},"reference":[{"key":"9919_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-4-431-55978-8","volume-title":"Information Geometry and Its Applications","author":"S Amari","year":"2016","unstructured":"Amari, S.: Information Geometry and Its Applications. Springer, Japan (2016)"},{"key":"9919_CR2","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/j.csda.2007.02.009","volume":"52","author":"C Bouveyron","year":"2007","unstructured":"Bouveyron, C., Girard, S., Schmid, C.: High-dimensional data clustering. Comput. Stat. Data Anal. 52, 502\u2013519 (2007)","journal-title":"Comput. Stat. Data Anal."},{"key":"9919_CR3","volume-title":"Handbook of Big Data","year":"2016","unstructured":"Buhlmann, P., Drineas, P., Kane, M., van der Laan, M. (eds.): Handbook of Big Data. CRC Press, Boca Raton (2016)"},{"key":"9919_CR4","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1111\/j.1467-9868.2009.00698.x","volume":"71","author":"O Capp\u00e9","year":"2009","unstructured":"Capp\u00e9, O., Moulines, E.: On-line expectation\u2013maximization algorithm for latent data models. J. R. Stat. Soc. B 71, 593\u2013613 (2009)","journal-title":"J. R. Stat. Soc. B"},{"key":"9919_CR5","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1198\/106186001317243403","volume":"10","author":"G Celeux","year":"2001","unstructured":"Celeux, G., Chretien, S., Forbes, F., Mkhadri, A.: A component-wise EM algorithm for mixtures. J. Comput. Graph. Stat. 10, 697\u2013712 (2001)","journal-title":"J. Comput. Graph. Stat."},{"key":"9919_CR6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4939-1384-8_6","volume-title":"Handbook of Simulation Optimization","author":"M Chau","year":"2015","unstructured":"Chau, M., Fu, M.C.: An overview of stochastic approximation. In: Fu, M.C. (ed.) Handbook of Simulation Optimization, pp. 149\u2013178. Springer, New York (2015)"},{"key":"9919_CR7","volume-title":"Stochastic Approximiation and Its Applications","author":"H-F Chen","year":"2003","unstructured":"Chen, H.-F.: Stochastic Approximiation and Its Applications. Kluwer, New York (2003)"},{"key":"9919_CR8","unstructured":"Cotter, A., Shamir, O., Srebro, N., Sridharan, K.: Better mini-batch algorithms via accelerated gradient methods. In: Advances in Neural Information Processing Systems, pp. 1647\u20131655 (2011)"},{"key":"9919_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9634-3","volume-title":"Probability for Statistics and Machine Learning","author":"A DasGupta","year":"2011","unstructured":"DasGupta, A.: Probability for Statistics and Machine Learning. Springer, New York (2011)"},{"key":"9919_CR10","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1214\/aos\/1018031103","volume":"27","author":"B Delyon","year":"1999","unstructured":"Delyon, B., Lavielle, M., Moulines, E.: Counvergence of a stochastic approximation version of the EM algorithm. Ann. Stat. 27, 94\u2013128 (1999)","journal-title":"Ann. Stat."},{"key":"9919_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B 39, 1\u201338 (1977)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"9919_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-6868-4","volume-title":"Seamless R and C++ Integration with Rcpp","author":"D Eddelbuettel","year":"2013","unstructured":"Eddelbuettel, D.: Seamless R and C++ Integration with Rcpp. Springer, New York (2013)"},{"issue":"2","key":"9919_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"7","author":"RA Fisher","year":"1936","unstructured":"Fisher, R.A.: The use of multiple measurements in taxonomic problems. Ann. Eugen. 7(2), 179\u2013188 (1936)","journal-title":"Ann. Eugen."},{"key":"9919_CR14","volume-title":"Statistical Distributions","author":"C Forbes","year":"2011","unstructured":"Forbes, C., Evans, M., Hastings, N., Peacock, B.: Statistical Distributions. Wiley, New York (2011)"},{"key":"9919_CR15","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1198\/106186005X59603","volume":"14","author":"C Fraley","year":"2005","unstructured":"Fraley, C., Raftery, A., Wehrens, R.: Incremental model-based clustering for large datasets with small clusters. J. Comput. Graph. Stat. 14, 529\u2013546 (2005)","journal-title":"J. Comput. Graph. Stat."},{"key":"9919_CR16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. Ser. A 155, 267\u2013305 (2016)","journal-title":"Math. Program. Ser. A"},{"key":"9919_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/9781316408032","volume-title":"Signal Processing and Networking for Big Data Applications","author":"Z Han","year":"2017","unstructured":"Han, Z., Hong, M., Wang, D.: Signal Processing and Networking for Big Data Applications. Cambridge University Press, Cambridge (2017)"},{"key":"9919_CR18","volume-title":"Handbook of Big Data Analytics","year":"2018","unstructured":"Hardle, W.K., Lu, H.H.-S., Shen, X. (eds.): Handbook of Big Data Analytics. Springer, Cham (2018)"},{"key":"9919_CR19","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm AS 136: A k-means clustering algorithm. J. R. Stat. Soc. Ser. C 28, 100\u2013108 (1979)","journal-title":"J. R. Stat. Soc. Ser. C"},{"key":"9919_CR20","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2, 193\u2013218 (1985)","journal-title":"J. Classif."},{"key":"9919_CR21","volume-title":"A Programming Language","author":"KE Iverson","year":"1967","unstructured":"Iverson, K.E.: A Programming Language. Wiley, New York (1967)"},{"key":"9919_CR22","volume-title":"Principal Component Analysis","author":"IT Jolliffe","year":"2002","unstructured":"Jolliffe, I.T.: Principal Component Analysis. Springer, New York (2002)"},{"key":"9919_CR23","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1111\/j.1467-842X.1992.tb01356.x","volume":"34","author":"PN Jones","year":"1992","unstructured":"Jones, P.N., McLachlan, G.J.: Fitting finite mixture models in a regression context. Aust. J. Stat. 34, 233\u2013240 (1992)","journal-title":"Aust. J. Stat."},{"key":"9919_CR24","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23, 462\u2013466 (1952)","journal-title":"Ann. Math. Stat."},{"key":"9919_CR25","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22, 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"key":"9919_CR26","volume-title":"Stochastic Approximiation and Recursive Algorithms and Applications","author":"HJ Kushner","year":"2003","unstructured":"Kushner, H.J., Yin, G.G.: Stochastic Approximiation and Recursive Algorithms and Applications. Springer, New York (2003)"},{"key":"9919_CR27","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86, 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"9919_CR28","doi-asserted-by":"crossref","unstructured":"Li, M., Zhang, T., Chen, Y., Smola, A.J.: Efficient mini-batch training for stochastic optimization. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 661\u2013670) (2014)","DOI":"10.1145\/2623330.2623612"},{"key":"9919_CR29","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1093\/biomet\/asn036","volume":"95","author":"F Liang","year":"2008","unstructured":"Liang, F., Zhang, J.: Estimating the false discovery rate using the stochastic approximation algorithm. Biometrika 95, 961\u2013977 (2008)","journal-title":"Biometrika"},{"key":"9919_CR30","doi-asserted-by":"crossref","DOI":"10.1002\/9780470191613","volume-title":"The EM Algorithm and Extensions","author":"GJ McLachlan","year":"2008","unstructured":"McLachlan, G.J., Krishnan, T.: The EM Algorithm and Extensions. Wiley, New York (2008)"},{"key":"9919_CR31","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1146\/annurev-statistics-031017-100325","volume":"6","author":"GJ McLachlan","year":"2019","unstructured":"McLachlan, G.J., Lee, S.X., Rathnayake, S.I.: Finite mixture models. Ann. Rev. Stat. Appl. 6, 355\u2013378 (2019)","journal-title":"Ann. Rev. Stat. Appl."},{"key":"9919_CR32","doi-asserted-by":"crossref","DOI":"10.1002\/0471721182","volume-title":"Finite Mixture Models","author":"GJ McLachlan","year":"2000","unstructured":"McLachlan, G.J., Peel, D.: Finite Mixture Models. Wiley, New York (2000)"},{"key":"9919_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v051.i12","volume":"51","author":"V Melnykov","year":"2012","unstructured":"Melnykov, V., Chen, W.-C., Maitra, R.: MixSim: an R package for simulating data to study performance of clustering algorithms. J. Stat. Softw. 51, 1\u201325 (2012)","journal-title":"J. Stat. Softw."},{"key":"9919_CR34","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1016\/j.patcog.2004.02.012","volume":"37","author":"S-K Ng","year":"2004","unstructured":"Ng, S.-K., McLachlan, G.J.: Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images. Pattern Recognit. 37, 1573\u20131589 (2004)","journal-title":"Pattern Recognit."},{"issue":"4","key":"9919_CR35","doi-asserted-by":"crossref","first-page":"e1246","DOI":"10.1002\/widm.1246","volume":"8","author":"HD Nguyen","year":"2018","unstructured":"Nguyen, H.D., Chamroukhi, F.: Practical and theoretical aspects of mixture-of-experts modeling: an overview. WIREs Data Min. Knowl. Discov. 8(4), e1246 (2018)","journal-title":"WIREs Data Min. Knowl. Discov."},{"key":"9919_CR36","volume-title":"Data Analytics: Concepts, Techniques, and Applications","author":"HD Nguyen","year":"2018","unstructured":"Nguyen, H.D., Jones, A.T.: Big Data-appropriate clustering via stochastic approximation and Gaussian mixture models. In: Ahmed, M., Pathan, A.-S.K. (eds.) Data Analytics: Concepts, Techniques, and Applications. CRC Press, Boca Raton (2018)"},{"key":"9919_CR37","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s11634-015-0209-7","volume":"9","author":"HD Nguyen","year":"2015","unstructured":"Nguyen, H.D., McLachlan, G.J.: Maximum likelihood estimation of Gaussian mixture models without matrix operations. Adv. Data Anal. Classif. 9, 371\u2013394 (2015)","journal-title":"Adv. Data Anal. Classif."},{"key":"9919_CR38","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1098\/rsta.1894.0003","volume":"185","author":"K Pearson","year":"1894","unstructured":"Pearson, K.: Contributions to the theory of mathematical evolution. Philos. Trans. R. Soc. Lond. A 185, 71\u2013110 (1894)","journal-title":"Philos. Trans. R. Soc. Lond. A"},{"key":"9919_CR39","first-page":"98","volume":"51","author":"BT Polyak","year":"1990","unstructured":"Polyak, B.T.: A new method of stochastic approximation type. Autom. Remote Control 51, 98\u2013107 (1990)","journal-title":"Autom. Remote Control"},{"key":"9919_CR40","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"BT Polyak","year":"1992","unstructured":"Polyak, B.T., Juditsky, A.B.: Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30, 838\u2013855 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"9919_CR41","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511777530","volume-title":"Advanced Mathematics for Applications","author":"A Prosperetti","year":"2011","unstructured":"Prosperetti, A.: Advanced Mathematics for Applications. Cambridge University Press, Cambridge (2011)"},{"key":"9919_CR42","unstructured":"R Core Team: R: a language and environment for statistical computing. R Foundation for Statistical Computing (2018)"},{"key":"9919_CR43","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"9919_CR44","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.14778\/2824032.2824115","volume":"8","author":"E Schubert","year":"2015","unstructured":"Schubert, E., Koos, A., Emrich, T., Zufle, A., Schmid, K.A., Zimek, A.: A framework for clustering uncertain data. Proc. VLDB Endow. 8, 1976\u20131979 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"9919_CR45","doi-asserted-by":"crossref","first-page":"289","DOI":"10.32614\/RJ-2016-021","volume":"8","author":"L Scrucca","year":"2016","unstructured":"Scrucca, L., Fop, M., Murphy, T.B., Raftery, A.E.: mclust: clustering, classification and density estimation using Gaussian finite mixture models. R J. 8, 289\u2013317 (2016)","journal-title":"R J."},{"key":"9919_CR46","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1013844811137","volume":"15","author":"N Vlassis","year":"2002","unstructured":"Vlassis, N., Likas, A.: A greedy EM algorithm for Gaussian mixture learning. Neural Process. Lett. 15, 77\u201387 (2002)","journal-title":"Neural Process. Lett."},{"key":"9919_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/1912526","volume":"50","author":"H White","year":"1982","unstructured":"White, H.: Maximum likelihood estimation of misspecified models. Econometrica 50, 1\u201325 (1982)","journal-title":"Econometrica"},{"key":"9919_CR48","volume-title":"Asymptotic Theory For Econometricians","author":"H White","year":"2001","unstructured":"White, H.: Asymptotic Theory For Econometricians. Academic Press, San Diego (2001)"},{"key":"9919_CR49","first-page":"1","volume":"40","author":"H Wickham","year":"2011","unstructured":"Wickham, H., Cook, D., Hofmann, H., Buja, A.: tourr: an R package for exploring multivariate data with projections. J. Stat. Softw. 40, 1\u201318 (2011)","journal-title":"J. Stat. Softw."},{"key":"9919_CR50","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1214\/aos\/1176346060","volume":"11","author":"CFJ Wu","year":"1983","unstructured":"Wu, C.F.J.: On the convergence properties of the EM algorithm. Ann. Stat. 11, 95\u2013103 (1983)","journal-title":"Ann. Stat."},{"key":"9919_CR51","unstructured":"Xu, L., Jordan, M.I., Hinton, G.E.: An alternative model for mixtures of experts. In: Advances in Neural Information Processing Systems, pp. 633\u2013640 (1995)"},{"key":"9919_CR52","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1111\/j.1467-9574.2008.00397.x","volume":"62","author":"J Zhang","year":"2008","unstructured":"Zhang, J., Liang, F.: Convergence of stochastic approximation algorithms under irregular conditions. Stat. Neerl. 62, 393\u2013403 (2008)","journal-title":"Stat. Neerl."},{"key":"9919_CR53","unstructured":"Zhao, T., Yu, M., Wang, Y., Arora, R., Liu, H.: Accelerated mini-batch randomized block coordinate descent method. In Advances in Neural Information Processing Systems (pp. 3329\u20133337) (2014)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-019-09919-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-019-09919-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-019-09919-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T23:57:57Z","timestamp":1722297477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-019-09919-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,10]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["9919"],"URL":"https:\/\/doi.org\/10.1007\/s11222-019-09919-4","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,10]]},"assertion":[{"value":"9 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}