{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:53:04Z","timestamp":1777477984445,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0031-3203(03)00140-7","type":"journal-article","created":{"date-parts":[[2003,11,7]],"date-time":"2003-11-07T15:56:24Z","timestamp":1068220584000},"page":"131-144","source":"Crossref","is-referenced-by-count":83,"title":["Competitive EM algorithm for finite mixture models"],"prefix":"10.1016","volume":"37","author":[{"given":"Baibo","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Changshui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xing","family":"Yi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(03)00140-7_BIB1","series-title":"Finite Mixture Models","author":"McLachlan","year":"2000"},{"key":"10.1016\/S0031-3203(03)00140-7_BIB2","series-title":"Algorithm for Clustering Data","author":"K. Jain","year":"1988"},{"key":"10.1016\/S0031-3203(03)00140-7_BIB3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/72.554192","article-title":"Modeling the manifolds of images of handwritten digits","volume":"8","author":"Hinton","year":"1997","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0031-3203(03)00140-7_BIB4","unstructured":"J.A. Bilmes, A gentle tutorial of the EM algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models, ICSI Technical report TR-97-021, http:\/\/www.icsi.berkeley.edu\/~bilmes\/papers\/em.ps.gz, 1997."},{"key":"10.1016\/S0031-3203(03)00140-7_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"maximum-likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster","year":"1977","journal-title":"J. R. Statist. Soc. B"},{"key":"10.1016\/S0031-3203(03)00140-7_BIB6","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1162\/089976600300015088","article-title":"SMEM algorithm for mixture models","volume":"12","author":"Ueda","year":"2000","journal-title":"Neural Comput."},{"issue":"2","key":"10.1016\/S0031-3203(03)00140-7_BIB7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0893-6080(97)00133-0","article-title":"Deterministic annealing EM algorithm","volume":"11","author":"Ueda","year":"1998","journal-title":"Neural Networks"},{"key":"10.1016\/S0031-3203(03)00140-7_BIB8","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1016\/S0031-3203(01)00080-2","article-title":"Robust clustering by deterministic agglomeration EM of mixtures of multivariate t-distributions","volume":"35","author":"Shoham","year":"2002","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(03)00140-7_BIB9","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1093\/biomet\/82.4.711","article-title":"Reversible jump Markov Chain Monte Carlo computation and Bayesian model determination","volume":"82","author":"Green","year":"1995","journal-title":"Biometrika"},{"issue":"8","key":"10.1016\/S0031-3203(03)00140-7_BIB10","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/34.946994","article-title":"Minimum-entropy data partitioning using reversible jump Markov Chain Monte Carlo","volume":"23","author":"Roberts","year":"2001","journal-title":"IEEE Trans. Pattern Analy. Matching Intelli."},{"issue":"3","key":"10.1016\/S0031-3203(03)00140-7_BIB11","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/34.990138","article-title":"Unsupervised learning of finite mixture models","volume":"24","author":"Figueiredo","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Matching Intelli."},{"key":"10.1016\/S0031-3203(03)00140-7_BIB12","series-title":"Independent Component Analysis: Principles and Practice","author":"Roberts","year":"2001"},{"key":"10.1016\/S0031-3203(03)00140-7_BIB13","unstructured":"G. Celeux, S. Chretien, F. Forbes, A. Mkhadri, A component-wise EM algorithm for mixtures, Technical report 3746, INRIA Rhone-Alpes, Frances, 1999, http:\/\/www.inria.fr\/RRRT\/RR-3746.html."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320303001407?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320303001407?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T09:03:03Z","timestamp":1734166983000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320303001407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0031320303001407"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(03)00140-7","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}