SMEM algorithm is not fully compatible with maximum-likelihood framework.

Neural Comput

Graduate School of Engineering, Tokyo Metropolitan University, Hachioji, Tokyo, 192-0397 Japan.

Published: June 2002

The expectation-maximization (EM) algorithm with split-and-merge operations (SMEM algorithm) proposed by Ueda, Nakano, Ghahramani, and Hinton (2000) is a nonlocal searching method, applicable to mixture models, for relaxing the local optimum property of the EM algorithm. In this article, we point out that the SMEM algorithm uses the acceptance-rejection evaluation method, which may pick up a distribution with smaller likelihood, and demonstrate that an increase in likelihood can then be guaranteed only by comparing log likelihoods.

Download full-text PDF

Source
http://dx.doi.org/10.1162/089976602753712927DOI Listing

Publication Analysis

Top Keywords

smem algorithm
12
algorithm fully
4
fully compatible
4
compatible maximum-likelihood
4
maximum-likelihood framework
4
framework expectation-maximization
4
algorithm
4
expectation-maximization algorithm
4
algorithm split-and-merge
4
split-and-merge operations
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!