Study of the properties of convergence of the EM-algorithm in a probabilistic latent semantic analysis (Q2836649)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6183498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Study of the properties of convergence of the EM-algorithm in a probabilistic latent semantic analysis |
scientific article; zbMATH DE number 6183498 |
Statements
3 July 2013
0 references
collaborative filtering
0 references
Study of the properties of convergence of the EM-algorithm in a probabilistic latent semantic analysis (English)
0 references
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.
0 references
0.7903932332992554
0 references
0.7584360837936401
0 references
0.7568034529685974
0 references
0.7523990273475647
0 references
