{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:39:37Z","timestamp":1768282777105,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Statistics and Computing"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1023\/a:1021987710829","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T18:56:29Z","timestamp":1048272989000},"page":"45-55","source":"Crossref","is-referenced-by-count":24,"title":["On the choice of the number of blocks with the incremental EM algorithm for the fitting of normal mixtures"],"prefix":"10.1007","volume":"13","author":[{"given":"S. K.","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. J.","family":"McLachlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5110188_CR1","series-title":"Technical Report No. MSR-TR-98-35","volume-title":"Scaling EM (expectation-maximization) clustering to large databases","author":"P.S. Bradley","year":"1998","unstructured":"Bradley P.S., Fayyad U.M., and Reina C.A. 1998. Scaling EM (expectation-maximization) clustering to large databases. Technical Report No. MSR-TR-98-35 (revised February, 1999), Microsoft Research, Seattle."},{"key":"5110188_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster A.P., Laird N.M., and Rubin D.B. 1977. Maximum likelihood from incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistical Society Series B 39: 1\u201338.","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"5110188_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/01621459.1989.10478752","volume":"84","author":"J.H. Friedman","year":"1989","unstructured":"Friedman J.H. 1989. Regularized discriminant analysis. Journal of the American Statistical Association 84: 165\u2013175.","journal-title":"Journal of the American Statistical Association"},{"key":"5110188_CR4","volume-title":"Statistical Pattern Recognition","author":"K. Fukunaga","year":"1990","unstructured":"Fukunaga K. 1990. Statistical Pattern Recognition, 2nd edn. Academic Press, New York.","edition":"2nd edn."},{"key":"5110188_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/01621459.1993.10594313","volume":"88","author":"M. Jamshidian","year":"1993","unstructured":"Jamshidian M. and Jennrich R.I. 1993. Conjugate gradient acceleration of the EM algorithm. Journal of the American Statistical Association 88: 221\u2013228.","journal-title":"Journal of the American Statistical Association"},{"key":"5110188_CR6","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1111\/1467-9868.00083","volume":"59","author":"M. Jamshidian","year":"1997","unstructured":"Jamshidian M. and Jennrich R.I. 1997. Acceleration of the EM algorithm by using quasi-Newton methods. Journal of the Royal Statistical Society Series B 59: 569\u2013587.","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"5110188_CR7","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/42.310875","volume":"13","author":"Z. Liang","year":"1994","unstructured":"Liang Z., MacFall J.R., and Harrington D.P. 1994. Parameter estimation and tissue segmentation from multispectral MR images. IEEE Transactions on Medical Imaging 13: 441\u2013449.","journal-title":"IEEE Transactions on Medical Imaging"},{"key":"5110188_CR8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1145\/347090.347123","volume-title":"Proceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"A. McCallum","year":"2000","unstructured":"McCallum A., Nigam K., and Ungar L.H. 2000. Efficient clustering of high-dimensional data sets with application to reference matching. In: Proceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, pp. 169\u2013178."},{"key":"5110188_CR9","volume-title":"The EM Algorithm and Extensions","author":"G.J. McLachlan","year":"1997","unstructured":"McLachlan G.J. and Krishnan T. 1997. The EM Algorithm and Extensions. Wiley, New York."},{"key":"5110188_CR10","unstructured":"McLachlan G.J. and Ng S.K. 2000. A sparse version of the incremental EM algorithm for large databases. Technical Report, Centre of Statistics, University of Queensland."},{"key":"5110188_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/0471721182","volume-title":"Finite Mixture Models","author":"G.J. McLachlan","year":"2000","unstructured":"McLachlan G.J. and Peel D. 2000. Finite Mixture Models. Wiley, New York."},{"key":"5110188_CR12","doi-asserted-by":"crossref","unstructured":"McLachlan G.J., Peel D., Basford K.E., and Adams P. 1999. The EMMIX software for the fitting of mixtures of normal and tcomponents. Journal of Statistical Software 4(2).","DOI":"10.18637\/jss.v004.i02"},{"key":"5110188_CR13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1111\/j.2517-6161.1989.tb01754.x","volume":"51","author":"I. Meilijson","year":"1989","unstructured":"Meilijson I. 1989. A fast improvement to the ECM algorithm on its own terms. Journal of the Royal Statistical Society Series B 51: 127\u2013138.","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"5110188_CR14","first-page":"326","volume":"22","author":"X.L. Meng","year":"1994","unstructured":"Meng X.L. 1994. On the rate of convergence of the ECM algorithm. Annals of Statistics 22: 326\u2013339.","journal-title":"Annals of Statistics"},{"key":"5110188_CR15","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1093\/biomet\/80.2.267","volume":"80","author":"X.L. Meng","year":"1993","unstructured":"Meng X.L. and Rubin D.B. 1993. Maximum likelihood estimation via the ECM algorithm: A general framework. Biometrika 80: 267\u2013278.","journal-title":"Biometrika"},{"key":"5110188_CR16","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1111\/1467-9868.00082","volume":"59","author":"X.L. Meng","year":"1997","unstructured":"Meng X.L. and van Dyk D. (1997). The EM algorithm-An old folksong sung to a fast newtune (with discussion). Journal of the Royal Statistical Society Series B 59: 511\u2013567.","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"5110188_CR17","first-page":"543","volume-title":"Advances in Neural Information Processing Systems 11","author":"A.W. Moore","year":"1999","unstructured":"Moore A.W. 1999. Very fast EM-based mixture model clustering using multiresolution kd-trees. In: Kearns M.S., Solla S.A., and Cohn D.A. (Eds.), Advances in Neural Information Processing Systems 11. MIT Press, Cambridge, MA, pp. 543\u2013549."},{"key":"5110188_CR18","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-94-011-5014-9_12","volume-title":"Learning in Graphical Models","author":"R.M. Neal","year":"1998","unstructured":"Neal R.M. and Hinton G.E. 1998. A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Jordan M.I. (Ed.), Learning in Graphical Models. Kluwer, Dordrecht, pp. 355\u2013368."},{"key":"5110188_CR19","unstructured":"Thiesson B. 1995. Accelerated quantification of Bayesian networks with incomplete data. In: Fayyad U.M. and Uthurusamy R. (Eds.), Proceedings of First International Conference on Knowledge Discovery and Data Mining. AAAI Press, pp. 306\u2013311."},{"key":"5110188_CR20","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1023\/A:1017986506241","volume":"45","author":"B. Thiesson","year":"2001","unstructured":"Thiesson B., Meek C., and Heckerman D. 2001. Accelerating EM for large databases. Machine Learning 45: 279\u2013299.","journal-title":"Machine Learning"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021987710829.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021987710829\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021987710829.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:26:42Z","timestamp":1754630802000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021987710829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["5110188"],"URL":"https:\/\/doi.org\/10.1023\/a:1021987710829","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}