Study of the properties of convergence of the EM-algorithm in a probabilistic latent semantic analysis
This paper introduces the basic concepts of probabilistic latent semantic analysis, presents deduction of expectation-maximization (EM) algorithm formulas and the pseudocodes. A theorem on the convergence rate of the EM algorithm is proved and superlinear convergence is formulated.
scientific article; zbMATH DE number 6183498