arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.0170cs.LGcs.IR
收藏

一种加快主题建模的新方法

A New Approach to Speeding Up Topic Modeling

Soochow University(苏州大学);City University of Hong Kong(香港城市大学)

Jia Zeng, Zhi-Qiang Liu, Xiao-Qin Cao

摘要:

潜在狄利克雷分配(LDA)是一种广泛使用的概率主题建模范式,近年来在计算机视觉和计算生物学中得到了广泛的应用。在本文中,我们提出了一种快速,准确的批量算法,主动信念传播(ABP),训练LDA。通常批量LDA算法需要重复扫描整个语料库并搜索完整的主题空间。批量LDA算法在处理包含大量主题的海量语料时,训练迭代往往效率低下且耗时。为了加快训练速度,ABP主动扫描语料子集并搜索主题空间子集进行主题建模,从而节省了每次迭代的大量训练时间。为了确保准确性,ABP只选择那些在残差置信传播(RBP)框架内贡献最大残差的文档和主题。在四个真实世界的语料库,ABP执行周围的$10$到$100$倍的速度比国家的最先进的批LDA算法具有可比的主题建模精度。

英文摘要:

Latent Dirichlet allocation (LDA) is a widely-used probabilistic topic modeling paradigm, and recently finds many applications in computer vision and computational biology. In this paper, we propose a fast and accurate batch algorithm, active belief propagation (ABP), for training LDA. Usually batch LDA algorithms require repeated scanning of the entire corpus and searching the complete topic space. To process massive corpora having a large number of topics, the training iteration of batch LDA algorithms is often inefficient and time-consuming. To accelerate the training speed, ABP actively scans the subset of corpus and searches the subset of topic space for topic modeling, therefore saves enormous training time in each iteration. To ensure accuracy, ABP selects only those documents and topics that contribute to the largest residuals within the residual belief propagation (RBP) framework. On four real-world corpora, ABP performs around $10$ to $100$ times faster than state-of-the-art batch LDA algorithms with a comparable topic modeling accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑