Deterministic Single-Pass Algorithm for LDA
Deterministic Single-Pass Algorithm for LDA
复制标题
DOI：
--
复制
发表时间：
2010-12
期刊：
影响因子：
--
通讯作者：
Issei Sato;Kenichi Kurihara;Hiroshi Nakagawa
中科院分区：
文献类型：
--
作者：
Issei Sato;Kenichi Kurihara;Hiroshi Nakagawa
我们开发了一个确定性的单通道算法的潜在狄利克雷分配（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.