Mixture modeling with applications in schizophrenia research

Qiang Wu and Allan R. Sampson

Computational Statistics & Data Analysis, 2009, vol. 53, issue 7, 2563-2572

Abstract: Finite 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 [Rai, S.N., Matthews, D.E., 1993. Improving the em algorithm. Biometrics 49, 587-591], Lange [Lange, K., 1995a. A gradient algorithm locally equivalent to the em algorithm. Journal of the Royal Statistical Society B 57(2) 425-437], and Titterington [Titterington, D.M., 1984. Recursive parameter estimation using incomplete data. Journal of the Royal Statistical Society B. 46, 257-267] 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.

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-9473(08)00573-2
Full text for ScienceDirect subscribers only.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:csdana:v:53:y:2009:i:7:p:2563-2572

Access Statistics for this article

Computational Statistics & Data Analysis is currently edited by S.P. Azen

More articles in Computational Statistics & Data Analysis from Elsevier
Bibliographic data for series maintained by Catherine Liu ().