{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T01:59:14Z","timestamp":1710899954536},"reference-count":29,"publisher":"Elsevier BV","issue":"16","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"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 Letters"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1016\/j.patrec.2012.06.017","type":"journal-article","created":{"date-parts":[[2012,8,7]],"date-time":"2012-08-07T14:31:34Z","timestamp":1344349894000},"page":"2120-2126","source":"Crossref","is-referenced-by-count":26,"title":["Random swap EM algorithm for Gaussian mixture models"],"prefix":"10.1016","volume":"33","author":[{"given":"Qinpei","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Ville","family":"Hautam\u00e4ki","sequence":"additional","affiliation":[]},{"given":"Ismo","family":"K\u00e4rkk\u00e4inen","sequence":"additional","affiliation":[]},{"given":"Pasi","family":"Fr\u00e4nti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.patrec.2012.06.017_b0005","unstructured":"Asuncion, A., Newman, D., 2007. \u201cUCI machine learning repository\u201d. ."},{"key":"10.1016\/j.patrec.2012.06.017_b0010","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0167-9473(02)00163-9","article-title":"\u201cChoosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture models\u201d","volume":"41","author":"Biernacki","year":"2003","journal-title":"Comput. Statist. Data Anal."},{"key":"10.1016\/j.patrec.2012.06.017_b0015","series-title":"Pattern Recognition and Machine Learning","author":"Bishop","year":"2006"},{"key":"10.1016\/j.patrec.2012.06.017_b0020","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0031-3203(03)00140-7","article-title":"\u201cThe SEM algorithm: A probabilistic teacher algorithm derived from the EM algorithm for the mixture problem\u201d","volume":"2","author":"Celeux","year":"1985","journal-title":"Comput. Statist. Quater."},{"key":"10.1016\/j.patrec.2012.06.017_b0025","first-page":"1","article-title":"\u201cMaximum likelihood from incomplete data via the EM algorithm\u201d","volume":"39","author":"Dempster","year":"1977","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"10.1016\/j.patrec.2012.06.017_b0030","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/34.990138","article-title":"\u201cUnsupervised learning of finite mixture models\u201d","author":"Figueiredo","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/j.patrec.2012.06.017_b0035","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S0167-9473(02)00163-9","article-title":"\u201cUnsupervised learning of finite mixture models\u201d","volume":"24","author":"Figueiredo","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/j.patrec.2012.06.017_b0040","unstructured":"Fr\u00e4nti P., 2009. \u201cClustering data sets\u201d. ."},{"key":"10.1016\/j.patrec.2012.06.017_b0045","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/s100440070007","article-title":"\u201cRandomized local search algorithm for the clustering problem\u201d","volume":"3","author":"Fr\u00e4nti","year":"2000","journal-title":"Pattern Anal. Appl."},{"key":"10.1016\/j.patrec.2012.06.017_b0050","doi-asserted-by":"crossref","unstructured":"Fr\u00e4nti, P., Virmajoki, O., Hautam\u00e4ki, V., 2008.\u201cProbabilistic clustering by random swap algorithm\u201d. In: 19th Internat. Conf. on Pattern Recognition, vol. 55, pp. 287\u2013314.","DOI":"10.1109\/ICPR.2008.4761798"},{"key":"10.1016\/j.patrec.2012.06.017_b0055","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.patrec.2004.07.007","article-title":"A local search approximation algorithm for k-means clustering","volume":"28","author":"Kanungo","year":"2004","journal-title":"Comput. Geometry: Theory Appl."},{"key":"10.1016\/j.patrec.2012.06.017_b0060","doi-asserted-by":"crossref","unstructured":"Li, Y., Li, L., 2009. \u201cA split and merge EM algorithm for color image segmentation\u201d. In: IEEE Internat. Conf. on Intelligent Computing and Intelligent Systems, pp. 395\u2013399.","DOI":"10.1016\/S0031-3203(03)00059-1"},{"key":"10.1016\/j.patrec.2012.06.017_b0065","series-title":"The EM Algorithm and Extensions","doi-asserted-by":"crossref","author":"Mclachlan","year":"1996","DOI":"10.1162\/089976603762553004"},{"key":"10.1016\/j.patrec.2012.06.017_b0070","series-title":"Finite Mixture Models","author":"McLachlan","year":"2000"},{"key":"10.1016\/j.patrec.2012.06.017_b0075","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/01621459.1990.10474930","article-title":"\u201cAn iterated local search approach for minimum sum-of-squares clustering\u201d","author":"Merz","year":"2003","journal-title":"Adv. Intell. Data Anal. V"},{"key":"10.1016\/j.patrec.2012.06.017_b0080","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1162\/089976602753712927","article-title":"\u201cSMEM algorithm is not fully compatible with maximum-likelihood framework\u201d","volume":"14","author":"Minagawa","year":"2002","journal-title":"Neural Comput."},{"key":"10.1016\/j.patrec.2012.06.017_b0085","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/ICIG.2011.110","article-title":"\u201cSupporting ranked boolean similarity queries in MARS\u201d","volume":"10","author":"Ortega","year":"1998","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/j.patrec.2012.06.017_b0090","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1109\/34.990138","article-title":"\u201cSMEM algorithm for mixture models\u201d","volume":"12","author":"Udea","year":"2000","journal-title":"Neural Comput."},{"key":"10.1016\/j.patrec.2012.06.017_b0095","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1162\/089976602753712927","article-title":"\u201cA maximum variance cluster algorithm\u201d","volume":"24","author":"Veenman","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/j.patrec.2012.06.017_b0100","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s100440070007","article-title":"\u201cEfficient greedy learning of Gaussian mixture models\u201d","volume":"15","author":"Verbeek","year":"2003","journal-title":"Neural Comput."},{"key":"10.1016\/j.patrec.2012.06.017_b0105","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.1016\/j.patrec.2004.07.007","article-title":"\u201cEstimation for the number of components in a mixture model using stepwise split-and-merge EM algorithm\u201d","volume":"25","author":"Wang","year":"2004","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/j.patrec.2012.06.017_b0110","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1080\/01621459.1990.10474930","article-title":"\u201cA Monte Carlo implementation of the EM algorithm and the poor man\u2019s data augmentation algorithms\u201d","volume":"85","author":"Wei","year":"1990","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/j.patrec.2012.06.017_b0115","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1016\/S0031-3203(03)00059-1","article-title":"\u201cEM algorithms for Gaussian mixtures with split-and-merge operation\u201d","volume":"36","author":"Zhang","year":"2003","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patrec.2012.06.017_b0120","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0031-3203(03)00140-7","article-title":"\u201cCompetitive EM algorithm for finite mixture models\u201d","volume":"37","author":"Zhang","year":"2004","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patrec.2012.06.017_b0125","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Dai, B., Tung, A., 2008.\u201cEstimating local optimums in EM algorithm over Gaussian mixture model\u201d, In: Proc. of the 25th Internat. Conf. on Machine Learning, pp. 1240\u20131247.","DOI":"10.1109\/TPAMI.2002.1033218"},{"key":"10.1016\/j.patrec.2012.06.017_b0130","doi-asserted-by":"crossref","unstructured":"Zhao, Q., Hautam\u00e4ki, V., K\u00e4rkk\u00e4inen, I., Fr\u00e4nti, P., 2009.\u201cRandom swap EM algorithm for finite mixture models in image segmentation\u201d, In: Proc. IEEE Internat. Conf. on Image Processing, Cairo, Egypt, pp. 2397\u20132400.","DOI":"10.1109\/69.738357"},{"key":"10.1016\/j.patrec.2012.06.017_b0135","doi-asserted-by":"crossref","unstructured":"Zhao, Q., Hautam\u00e4ki V., Fr\u00e4nti, P., 2011. \u201cRsem: An accelerated algorithm on repeated em\u201d, In: 2011 Sixth Internat. Conf. on Image and Graphics, pp. 135\u2013140.","DOI":"10.1109\/ICIG.2011.110"},{"key":"10.1016\/j.patrec.2012.06.017_b0140","doi-asserted-by":"crossref","unstructured":"Helen, M., Virtanen, T.: Query by example of audio signals using Euclidean 399 distance between gaussian mixture models, In: ICASSP\u201907, 2007, pp. 225\u2013228.","DOI":"10.1109\/ICASSP.2007.366657"},{"issue":"8","key":"10.1016\/j.patrec.2012.06.017_b0145","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/TPAMI.2005.162","article-title":"Genetic-based em algorithm for learning Gaussian mixture models","volume":"27","author":"Pernkopf","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865512002140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865512002140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T16:05:10Z","timestamp":1562083510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865512002140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":29,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["S0167865512002140"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.patrec.2012.06.017","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":["Artificial Intelligence","Computer Vision and Pattern Recognition","Signal Processing","Software"],"published":{"date-parts":[[2012,12]]}}}