Latent Dirichlet Allocation
Blei et al., 2003, Latent Dirichlet Allocation (Journal of Machine Learning Research)
Subscriber deck — free during early access
1 cards in “4.3 Probabilistic latent semantic indexing” · whole deck
4.3 Probabilistic latent semantic indexing
- What is the pLSI model, and why isn’t it a well-defined generative model of documents?\(p(d, w_n) = p(d) \sum_z p(w_n \mid z)\, p(z \mid d)\): a document index \(d\) and a word are independent given a topic. But \(d\) is a dummy index over training documents, so \(p(z \mid d)\) exists only for them. LDA instead treats topic proportions as a \(k\)-parameter hidden random variable, so parameters don’t grow with the corpus.
- Blei et al., 2003, Latent Dirichlet Allocation (Journal of Machine Learning Research), §4.3, pp. 1000–1001
Source
- David M. Blei, Andrew Y. Ng and Michael I. Jordan. 2003. Latent Dirichlet Allocation. In Journal of Machine Learning Research, pp. 993–1022. https://www.jmlr.org/papers/v3/blei03a.html