Theoretical analysis of cross-validation(CV)-EM algorithm

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Expectation-Maximization (EM) algorithm is a typical method to estimate parameters of a model with hidden variables and is widely used for many applications. The EM algorithm is simple but sometimes overfits to specific examples and its likelihood diverges to infinite. To overcome the problem of overfitting, Shinozaki and Osterndorf have proposed the CV-EM algorithm in which the cross-validation technique is incorporated into the conventional EM algorithm, and have demonstrated validity of the algorithm with numerical experiments. In this article, we theoretically investigate properties of the CV-EM algorithm with an asymptotic analysis and reveal its mechanism of robustness. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Takenouchi, T., & Ikeda, K. (2010). Theoretical analysis of cross-validation(CV)-EM algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6354 LNCS, pp. 321–326). https://doi.org/10.1007/978-3-642-15825-4_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free