{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T14:10:58Z","timestamp":1774879858586,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1023\/a:1017986506241","type":"journal-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T09:36:44Z","timestamp":1041241004000},"page":"279-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Accelerating EM for Large Databases"],"prefix":"10.1007","volume":"45","author":[{"given":"Bo","family":"Thiesson","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Meek","sequence":"additional","affiliation":[]},{"given":"David","family":"Heckerman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"358704_CR1","volume-title":"Categorical Data Analysis","author":"A. Agresti","year":"1990","unstructured":"Agresti, A. (1990). Categorical Data Analysis. New York: John Wiley and Sons."},{"key":"358704_CR2","unstructured":"Bradley, P., Fayyad, U., & Reina, C. (1998). Scaling EM (Expectation Maximization) clustering to large databases. Technical Report MSR-TR-98-35, Microsoft Research."},{"key":"358704_CR3","first-page":"153","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P. Cheeseman","year":"1995","unstructured":"Cheeseman, P. & Stutz, J. (1995). Bayesian classification (AutoClass): Theory and results. In U. Fayyad, G. Piatesky-Shapiro, P. Smyth, & R. Uthurusamy (Eds.), Advances in Knowledge Discovery and Data Mining (pp. 153\u2013180). Menlo Park, CA: AAAI Press."},{"key":"358704_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1023\/A:1007469629108","volume":"29","author":"D. M. Chickering","year":"1997","unstructured":"Chickering, D. M. & Heckerman, D. (1997). Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables. Machine Learning, 29, 181\u2013212.","journal-title":"Machine Learning"},{"key":"358704_CR5","first-page":"109","volume-title":"Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence","author":"D. M. Chickering","year":"1999","unstructured":"Chickering, D. M. & Heckerman, D. (1999) Fast learning from sparse data. In K. B. Laskey & H. Prade (Eds.), Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (pp. 109\u2013115). San Mateo, CA: Morgan Kaufmann Publishers."},{"key":"358704_CR6","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., & 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":"358704_CR7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1111\/j.2517-6161.1990.tb01798.x","volume":"52","author":"P. J. Green","year":"1990","unstructured":"Green, P. J. (1990). On use of the EM algorithm for penalized likelihood estimation. Journal of the Royal Statistical Society, Series B, 52, 443\u2013452.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"358704_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/ICASSP.1995.479281","volume":"1","author":"X. Huang","year":"1995","unstructured":"Huang, X., Acero, A., Alleva, F., Hwang, M.-Y., Jiang, L., & Mahajan, M. (1995). Microsoft Windows highly intelligent speech recognizer: Whisper. In IEEE International Conference on Acoustics, Speech, and Signal Processing, 1995. ICASSP-95 (Vol. 1, pp. 93\u201396).","journal-title":"IEEE International Conference on Acoustics, Speech, and Signal Processing, 1995. ICASSP-95"},{"issue":"421","key":"358704_CR9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/01621459.1993.10594313","volume":"88","author":"M. Jamshidian","year":"1993","unstructured":"Jamshidian, M. & Jennrich, R. I. (1993). Conjugate gradient acceleration of the EM algorithm. Journal of the American Statistical Association, 88(421), 221\u2013228.","journal-title":"Journal of the American Statistical Association"},{"issue":"2","key":"358704_CR10","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1111\/j.2517-6161.1982.tb01203.x","volume":"44","author":"T. A. Louis","year":"1982","unstructured":"Louis, T. A. (1982). Finding the observed information matrix when using the EM algorithm. Journal of the Royal Statistical Society, Series B, 44(2), 226\u2013233.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"358704_CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1145\/347090.347123","volume-title":"Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"A. McCallum","year":"2000","unstructured":"McCallum, A., Nigam, K., & Ungar, L. H. (2000). Efficient clustering of high-dimensional data sets with application to reference matching. In R. Ramakrishnan & S. Stolfo (Eds.), Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 169\u2013178). New York: ACM."},{"issue":"1","key":"358704_CR12","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 EM algorithm on its own terms. Journal of the Royal Statistical Society, Series B, 51(1), 127\u2013138.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"issue":"2","key":"358704_CR13","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. & Rubin, D. B. (1993). Maximum likelihood estimation via the ECM algorithm: Ageneral framework. Biometrika, 80(2), 267\u2013278.","journal-title":"Biometrika"},{"key":"358704_CR14","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. & van Dyk, D. (1997). The EM algorithm\u2014an old folksong sung to a fast new tune (with discussion). Journal of the Royal Statistical Society, Series B, 59, 511\u2013567.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"358704_CR15","first-page":"543","volume-title":"Advances in Neural Information Processing Systems. Proceedings of the 1998 Conference","author":"A. Moore","year":"1999","unstructured":"Moore, A. (1999). Very fast EM-based mixture model clustering using multiresolution kd-trees. In M. S. Kearns, S. A. Solla, & D. A. Cohn (Eds.), Advances in Neural Information Processing Systems. Proceedings of the 1998 Conference (Vol. 11, pp. 543\u2013549). Cambridge, MA: MIT Press."},{"key":"358704_CR16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-94-011-5014-9_12","volume-title":"Learning in Graphical Models","author":"R. Neal","year":"1998","unstructured":"Neal, R. & Hinton, G. (1998). A view of the EM algorithm that justifies incremental, sparse, and other variants. In M. Jordan (Ed.), Learning in Graphical Models (pp. 355\u2013371). The Netherlands, Kluwer Academic Publishers."},{"key":"358704_CR17","volume-title":"Soft competitive adaptation: Neural network learning algorithms based on fitting statistical mixtures","author":"S. J. Nowlan","year":"1991","unstructured":"Nowlan, S. J. (1991). Soft competitive adaptation: Neural network learning algorithms based on fitting statistical mixtures. Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh."},{"key":"358704_CR18","series-title":"Technical Report","volume-title":"Fast learning of on-line em algorithm","author":"M. Sato","year":"1999","unstructured":"Sato, M. (1999). Fast learning of on-line em algorithm. Technical Report, ATR Human Information Processing Research Laboratories 2-2 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-0288, Japan."},{"issue":"2","key":"358704_CR19","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1162\/089976600300015853","volume":"12","author":"M. Sato","year":"2000","unstructured":"Sato, M. & Ishii, S. (2000). On-line EM algorithm for the normalized Gaussian network. Neural Computation, 12(2), 407\u2013432.","journal-title":"Neural Computation"},{"key":"358704_CR20","first-page":"306","volume-title":"Proceedings of First International Conference on Knowledge Discovery and Data Mining","author":"B. Thiesson","year":"1995","unstructured":"Thiesson, B. (1995). Accelerated quantification of Bayesian networks with incomplete data. In U. M. Fayyad, & R. Uthurusamy (Eds.), Proceedings of First International Conference on Knowledge Discovery and Data Mining (pp. 306\u2013311). Menlo Park, CA: AAAI Press."},{"key":"358704_CR21","first-page":"631","volume-title":"Bayesian Statistics: Proceedings of the Sixth Valencia International Meeting","author":"B. Thiesson","year":"1999","unstructured":"Thiesson, B., Meek, C., Chickering, D., & Heckerman, D. (1999). Computational efficient methods for selectiong among mixtures of graphical models, with discussion. In J. M. Bernardo, J. O. Berger, A. P. Dawid, & A. F. M. Smith (Eds.), Bayesian Statistics: Proceedings of the Sixth Valencia International Meeting (Vol. 6, pp. 631\u2013656). Oxford: Oxford University Press."},{"key":"358704_CR22","first-page":"103","volume-title":"Proceedings of the Fifteenth ACM SIGMOD International Conference on Management of Data and Symposium on Principles of Database Systems","author":"T. Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R., & Livny, M. (1996). Birch: An efficient data clustering method for very large databases. In Proceedings of the Fifteenth ACM SIGMOD International Conference on Management of Data and Symposium on Principles of Database Systems (pp. 103\u2013114). New York: ACM."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017986506241.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1017986506241\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017986506241.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:37:47Z","timestamp":1752147467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1017986506241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["358704"],"URL":"https:\/\/doi.org\/10.1023\/a:1017986506241","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,12]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}