Study of the properties of convergence of the EM-algorithm in a probabilistic latent semantic analysis
type: Item
instance of: scholarly article
zbMATH Open document ID: 1274.68122
author: V. A. Leksin
publication date: 2013-07-03T00:00:00Z
full work available at URL: p1536
Mathematics Subject Classification ID: 68P99
Mathematics Subject Classification ID: 65C60
zbMATH DE Number: 6183498
zbMATH Keywords: collaborative filtering
MaRDI profile type: Publication
title: Study of the properties of convergence of the EM-algorithm in a probabilistic latent semantic analysis
published in: Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki
review text: 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.
description: scientific article; zbMATH DE number 6183498