Wu, QiangSampson, Allan R.2011-01-282011-05-172011-01-282011-05-172009-05-15Computational Statistics and Data Analysis; 53:7 p. 2563-2572http://hdl.handle.net/10342/3120Finite mixture modeling, together with the EM algorithm, have been widely used in clustering analysis. Under such methods, the unknown group membership is usually treated as missing data. When the "complete data" (log-)likelihood function does not have an explicit solution, the simplicity of the EM algorithm breaks down. Authors, including Rai and Matthews (1993), Lange (1995a) and Titterington (1984), developed modified algorithms therefore. As motivated by research in a large neurobiological project, we propose in this paper a new variant of such modifications and show that it is self-consistent. Moreover, simulations are conducted to demonstrate that the new variant converges faster than its predecessors. Originally published Computational Statistics and Data Analysis, Vol. 53, No. 7, May 2009en-USAuthor notified of opt-out rights by Cammie JenningsClusteringEM algorithmEM1 algorithmEM-gradient algorithmFinite mixture modelsSchizophreniaArticlePMC267872910.1016/j.csda.2008.12.005