Name
Abstract | ||
|---|---|---|
As the emergence and the thriving development of social networks, a huge number of short texts are accumulated and need to be processed. Inferring latent topics of collected short texts is an essential task for understanding its hidden structure and predicting new contents. A biterm topic model (BTM) was recently proposed for short texts to overcome the sparseness of document-level word co-occurrences by directly modeling the generation process of word pairs. Stochastic inference algorithms based on collapsed Gibbs sampling (CGS) and collapsed variational inference have been proposed for BTM. However, they either require large computational complexity, or rely on very crude estimation that does not preserve sufficient statistics. In this work, we develop a stochastic divergence minimization (SDM) inference algorithm for BTM to achieve better predictive likelihood in a scalable way. Experiments show that SDM-BTM trained by 30% data outperforms the best existing algorithm trained by full data. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1587/transinf.2017EDP7310 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | DocType | Volume |
short text, topic model, biterm, stochastic inference algorithm | Journal | E101D |
Issue | ISSN | Citations |
3 | 1745-1361 | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhenghang Cui | 1 | 0 | 2.03 |
| Issei Sato | 2 | 331 | 41.59 |
| Masashi Sugiyama | 3 | 3353 | 264.24 |