A fast and scalable supervised topic model using stochastic variational inference and MapReduce

Wenzhuo Song, Bo Yang, Xuehua Zhao, Fei Li
{"title":"A fast and scalable supervised topic model using stochastic variational inference and MapReduce","authors":"Wenzhuo Song, Bo Yang, Xuehua Zhao, Fei Li","doi":"10.1109/ICNIDC.2016.7974542","DOIUrl":null,"url":null,"abstract":"An important and widespread topic in cloud computing is text analyzing. People often use topic model which is a popular and effective technology to deal with related tasks. Among all the topic models, sLDA is acknowledged as a popular supervised topic model, which adds a response variable or category label with each document, so that the model can uncover the latent structure of a text dataset as well as retains the predictive power for supervised tasks. However, sLDA needs to process all the documents at each iteration in the training period. When the size of dataset increases to the volume that one node cannot deal with, sLDA will no longer be competitive. In this paper we propose a novel model named Mr.sLDA which extends sLDA with stochastic variational inference (SVI) and MapReduce. SVI can reduce the computational burden of sLDA and MapReduce extends the algorithm with parallelization. Mr.sLDA makes the training become more efficient and the training method can be easily implemented in a large computer cluster or cloud computing. Empirical results show that our approach has an efficient training process, and similar accuracy with sLDA.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNIDC.2016.7974542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

An important and widespread topic in cloud computing is text analyzing. People often use topic model which is a popular and effective technology to deal with related tasks. Among all the topic models, sLDA is acknowledged as a popular supervised topic model, which adds a response variable or category label with each document, so that the model can uncover the latent structure of a text dataset as well as retains the predictive power for supervised tasks. However, sLDA needs to process all the documents at each iteration in the training period. When the size of dataset increases to the volume that one node cannot deal with, sLDA will no longer be competitive. In this paper we propose a novel model named Mr.sLDA which extends sLDA with stochastic variational inference (SVI) and MapReduce. SVI can reduce the computational burden of sLDA and MapReduce extends the algorithm with parallelization. Mr.sLDA makes the training become more efficient and the training method can be easily implemented in a large computer cluster or cloud computing. Empirical results show that our approach has an efficient training process, and similar accuracy with sLDA.
基于随机变分推理和MapReduce的快速可扩展监督主题模型
云计算中一个重要而广泛的话题是文本分析。人们经常使用主题模型来处理相关任务,这是一种流行且有效的技术。在所有主题模型中,sLDA是公认的流行的监督主题模型,它在每个文档中添加响应变量或类别标签,使模型能够揭示文本数据集的潜在结构,并保留对监督任务的预测能力。但是,sLDA需要在训练周期的每次迭代中处理所有的文档。当数据集的大小增加到一个节点无法处理的体积时,sLDA将不再具有竞争力。在本文中,我们提出了一个新的模型Mr.sLDA,它将sLDA扩展为随机变分推理(SVI)和MapReduce。SVI可以减少sLDA的计算负担,MapReduce通过并行化扩展了该算法。Mr.sLDA使训练变得更加高效,训练方法可以很容易地在大型计算机集群或云计算中实现。实验结果表明,该方法具有高效的训练过程,且准确率与sLDA相近。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信