{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:44:40Z","timestamp":1761648280974},"reference-count":30,"publisher":"MIT Press - Journals","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evolutionary Computation"],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> This paper describes the evolutionary split and merge for expectation maximization (ESM-EM) algorithm and eight of its variants, which are based on the use of split and merge operations to evolve Gaussian mixture models. Asymptotic time complexity analysis shows that the proposed algorithms are competitive with the state-of-the-art genetic-based expectation maximization (GA-EM) algorithm. Experiments performed in 35 data sets showed that ESM-EM can be computationally more efficient than the widely used multiple runs of EM (for different numbers of components and initializations). Moreover, a variant of ESM-EM free from critical parameters was shown to be able to provide competitive results with GA-EM, even when GA-EM parameters were fine-tuned a priori. <\/jats:p>","DOI":"10.1162\/evco_a_00152","type":"journal-article","created":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T18:18:10Z","timestamp":1431022690000},"page":"293-317","source":"Crossref","is-referenced-by-count":5,"title":["Evolving Gaussian Mixture Models with Splitting and Merging Mutation Operators"],"prefix":"10.1162","volume":"24","author":[{"given":"Thiago Ferreira","family":"Cov\u00f5es","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of S\u00e3o Paulo, S\u00e3o Carlos, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo Raul","family":"Hruschka","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of S\u00e3o Paulo, S\u00e3o Carlos, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joydeep","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"281","reference":[{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1887\/0750306645"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554761"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-45528-0"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9059-6"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.11.010"},{"key":"B7","first-page":"106","author":"Cov\u00f5es T. F.","year":"2011","journal-title":"Proceedings of the International Conference on Machine Learning and Applications"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"B11","volume-title":"Genetic algorithms and grouping problems","author":"Falkenauer E","year":"1998"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1109\/34.990138"},{"key":"B13","volume-title":"Matrix computations","author":"Golub G. H.","year":"1996","edition":"3"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1109\/ISDA.2009.80"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2008.2007252"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2009.625"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2007.70244"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1198\/jcgs.2009.08054"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1002\/0471721182"},{"key":"B20","volume-title":"The EM algorithm and extensions","author":"McLachlan G. J.","year":"1997"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.06.010"},{"key":"B22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.07.016"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.162"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1137\/1026034"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1109\/89.365379"},{"key":"B26","volume-title":"Stochastic complexity in statistical inquiry theory","author":"Rissanen J","year":"1989"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2007.11.003"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2007.895453"},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(97)00133-0"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015088"},{"key":"B31","volume-title":"Clustering","author":"Xu R.","year":"2009"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(03)00059-1"}],"container-title":["Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/EVCO_a_00152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:58:39Z","timestamp":1615586319000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/evco\/article\/24\/2\/293-317\/1011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1162\/EVCO_a_00152"],"URL":"https:\/\/doi.org\/10.1162\/evco_a_00152","relation":{},"ISSN":["1063-6560","1530-9304"],"issn-type":[{"value":"1063-6560","type":"print"},{"value":"1530-9304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}