Exploiting Global Semantic Similarity Biterms for Short-Text Topic Discovery

Heng-yang Lu, Gao-Jian Ge, Yun Li, Chong-Jun Wang, Junyuan Xie
{"title":"Exploiting Global Semantic Similarity Biterms for Short-Text Topic Discovery","authors":"Heng-yang Lu, Gao-Jian Ge, Yun Li, Chong-Jun Wang, Junyuan Xie","doi":"10.1109/ICTAI.2018.00151","DOIUrl":null,"url":null,"abstract":"The demand for mining massive short-text data from the Internet has promoted researches on topic models. There exist many schemes trying to solve the sparsity problems brought by short texts, mainly based on data aggregation or model improvement. Among them, Biterm Topic Model changes the way of modeling topics, which is on document-level biterms and has shown creativity and effectiveness. However, this may ignore those semantically similar and rarely co-occurrent word pairs, which are denoted as global biterms in this paper. Inspired by the successful application of word embeddings in GPU-DMM, we exploit word embeddings to extract semantically similar word pairs from the whole corpus to help discover better topics. We call this model as GloSS, which takes advantages of both the approach to model topics and word embeddings. Experimental results on two open-source and real datasets are superior to state-of-the-art topic models for short texts.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2018.00151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The demand for mining massive short-text data from the Internet has promoted researches on topic models. There exist many schemes trying to solve the sparsity problems brought by short texts, mainly based on data aggregation or model improvement. Among them, Biterm Topic Model changes the way of modeling topics, which is on document-level biterms and has shown creativity and effectiveness. However, this may ignore those semantically similar and rarely co-occurrent word pairs, which are denoted as global biterms in this paper. Inspired by the successful application of word embeddings in GPU-DMM, we exploit word embeddings to extract semantically similar word pairs from the whole corpus to help discover better topics. We call this model as GloSS, which takes advantages of both the approach to model topics and word embeddings. Experimental results on two open-source and real datasets are superior to state-of-the-art topic models for short texts.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于全局语义相似bitterms的短文本主题发现
从互联网中挖掘海量短文本数据的需求推动了主题模型的研究。目前已有许多解决短文本稀疏性问题的方案,主要是基于数据聚合或模型改进。其中,Biterm Topic Model改变了在文档级Biterm上对主题进行建模的方式,显示出创造性和有效性。然而,这可能会忽略那些语义相似且很少共现的词对,本文将其表示为全局双术语。受词嵌入在GPU-DMM中的成功应用启发,我们利用词嵌入从整个语料库中提取语义相似的词对,以帮助发现更好的主题。我们把这个模型称为GloSS,它同时利用了建模主题和词嵌入的方法。在两个开源和真实数据集上的实验结果优于最先进的短文本主题模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
[Title page i] Enhanced Unsatisfiable Cores for QBF: Weakening Universal to Existential Quantifiers Effective Ant Colony Optimization Solution for the Brazilian Family Health Team Scheduling Problem Exploiting Global Semantic Similarity Biterms for Short-Text Topic Discovery Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1