资源分类
》 资源 》论文》Deterministic Single-Pass Algorithm for LDA

Deterministic Single-Pass Algorithm for LDA

2020-01-06 | |  66 |   39 |   0

Abstract

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.

上一篇：EVALUATING THE SEARCH PHASE OFN EURAL ARCHITECTURE SEARCH

下一篇：Generalized roof duality and bisubmodular functions

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...