Deterministic Single-Pass Algorithm for LDA

We develop a deterministic single-pass algorithm for latent Dirichlet allocation (LDA) in order to process received documents one at a time and then discard them in an excess text stream. Our algorithm does not need to store old statistics for all data. The proposed algorithm is much faster than a batch algorithm and is comparable to the batch algorithm in terms of perplexity in experiments.

Authors

• Issei Sato
• Kenichi Kurihara
• Hiroshi Nakagawa

Keywords

No keywords are indexed for this paper.