arrow
返回

FastBTM: Reducing the sampling time for biterm topic model

delete2017-09-01
delete17
PRE
AI
X
Xingwei He
徐
徐华 (Hua Xu) *
J
Jia Li
H
He Liu
DOI:10.1016/j.knosys.2017.06.005delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Due to the popularity of social networks, such as microblogs and Twitter, a vast amount of short text data is created every day. Much recent research in short text becomes increasingly significant, such as topic inference for short text. Biterm topic model (BTM) benefits from the word co-occurrence patterns of the corpus, which makes it perform better than conventional topic models in uncovering latent semantic relevance for short text. However, BTM resorts to Gibbs sampling to infer topics, which is very time consuming, especially for large-scale datasets or when the number of topics is extremely large. It requires 0(K) operations per sample for K topics, where K denotes the number of topics in the corpus. In this paper, we propose an acceleration algorithm of BTM, FastBTM, using an efficient sampling method for BTM, which converges much faster than BTM without degrading topic quality. FastBTM is based on Metropolis Hastings and alias method, both of which have been widely adopted in Latent Dirichlet Allocation (LDA) model and achieved outstanding speedup. Our FastBTM can effectively reduce the sampling complexity of biterm topic model from 0(K) to 0(1) amortized time. We carry out a number of experiments on three datasets including two short text datasets, Tweets2011 Collection dataset and Yahoo! Answers dataset, and one long document dataset, Enron dataset. Our experimental results show that when the number of topics K increases, the gap in running time speed between FastBTM and BTM gets especially larger. In addition, our FastBTM is effective for both short text datasets and long document datasets. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
BTM
Topic model
Alias method
Metropolis-Hastings
Acceleration algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.2W
被引数:
4.5W

机构

B
beijing university of posts & telecommunications
学者数:
1.4W
论文数: 1.2W
被引数: 9
S
shanghai jiao tong university
学者数:
15.7W
论文数: 11.7W
被引数: 159
T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
学者 查看更多机构
引用论文

引用论文

An introduction to MCMC for machine learning机器学习的MCMC简介
err2003-01-01
err1.9K
errOAAI
errAndrieu, C; de Freitas, N; Doucet, A; Jordan, MI
err分享
err收藏
Highly polymerized proanthocyanidins (PAC) components from blueberry leaf and stem significantly inhibit SARS-CoV-2 infection via inhibition of ACE2 and viral 3CLpro enzymes
err2022-07-01
err0
errOAAI
errKazuhiro Sugamoto; Yuri L. Tanaka; Akatsuki Saito; Yoh Goto; Takayuki Nakayama; Tamaki Okabayashi; Hisato Kunitake; Kazuhiro Morishita
err分享
err收藏
Methanogenic Conditions in Northern Peat Soils
err2007-02-23
err0
PREAI
errJoseph B. Yavitt; Michael Seidman-Zager
err分享
err收藏
学者 查看更多内容