基于LDA主题模型和稀疏表示分类器的查询分类

Indrani Bhattacharya, J. Sil
{"title":"基于LDA主题模型和稀疏表示分类器的查询分类","authors":"Indrani Bhattacharya, J. Sil","doi":"10.1145/2888451.2888474","DOIUrl":null,"url":null,"abstract":"Users often seek for information by submitting query consisting of keywords may belong to multiple topics, representing overlapping concepts. Objective of the work is to classify the query into a topic class label by considering the query keywords distributed over various topics. The approach effectively reduces the search space in order to retrieve information computationally efficient way. First we apply Latent Dirichlet Allocation (LDA) on the entire corpus to group the documents into topics consisting of unique words. As a next step, a term vocabulary (TRV) has been built with unique words present in the topics. We develop a Topic-Vocabulary Matrix (TVM) by encoding the TRV with respect to each topic. The TVM expresses word distribution among the topics and presented as training data set, which is sparse. The query is encoded by the same way and submitted as test data. We apply sparse representation based classifier (SRC) to classify the query as a topic. The proposed approach shows satisfactory performance with 93% accuracy in classifying query.","PeriodicalId":136431,"journal":{"name":"Proceedings of the 3rd IKDD Conference on Data Science, 2016","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Query Classification using LDA Topic Model and Sparse Representation Based Classifier\",\"authors\":\"Indrani Bhattacharya, J. Sil\",\"doi\":\"10.1145/2888451.2888474\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Users often seek for information by submitting query consisting of keywords may belong to multiple topics, representing overlapping concepts. Objective of the work is to classify the query into a topic class label by considering the query keywords distributed over various topics. The approach effectively reduces the search space in order to retrieve information computationally efficient way. First we apply Latent Dirichlet Allocation (LDA) on the entire corpus to group the documents into topics consisting of unique words. As a next step, a term vocabulary (TRV) has been built with unique words present in the topics. We develop a Topic-Vocabulary Matrix (TVM) by encoding the TRV with respect to each topic. The TVM expresses word distribution among the topics and presented as training data set, which is sparse. The query is encoded by the same way and submitted as test data. We apply sparse representation based classifier (SRC) to classify the query as a topic. The proposed approach shows satisfactory performance with 93% accuracy in classifying query.\",\"PeriodicalId\":136431,\"journal\":{\"name\":\"Proceedings of the 3rd IKDD Conference on Data Science, 2016\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd IKDD Conference on Data Science, 2016\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2888451.2888474\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd IKDD Conference on Data Science, 2016","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2888451.2888474","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

用户经常通过提交由多个关键词组成的查询来查找信息,这些关键词可能属于多个主题,表示重叠的概念。该工作的目的是通过考虑分布在各个主题上的查询关键字,将查询分类为主题类标签。该方法有效地缩小了搜索空间,以获得计算效率高的信息检索方式。首先,我们对整个语料库应用潜在狄利克雷分配(Latent Dirichlet Allocation, LDA)将文档分组到由唯一单词组成的主题中。作为下一步,术语词汇表(TRV)已经建立,其中包含主题中存在的独特单词。通过对每个主题的TRV进行编码,建立了主题词汇矩阵(TVM)。TVM表示单词在主题之间的分布,并作为训练数据集表示,该数据集是稀疏的。查询以同样的方式编码,并作为测试数据提交。我们使用基于稀疏表示的分类器(SRC)将查询分类为主题。该方法在分类查询中取得了令人满意的性能,准确率达到93%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Query Classification using LDA Topic Model and Sparse Representation Based Classifier
Users often seek for information by submitting query consisting of keywords may belong to multiple topics, representing overlapping concepts. Objective of the work is to classify the query into a topic class label by considering the query keywords distributed over various topics. The approach effectively reduces the search space in order to retrieve information computationally efficient way. First we apply Latent Dirichlet Allocation (LDA) on the entire corpus to group the documents into topics consisting of unique words. As a next step, a term vocabulary (TRV) has been built with unique words present in the topics. We develop a Topic-Vocabulary Matrix (TVM) by encoding the TRV with respect to each topic. The TVM expresses word distribution among the topics and presented as training data set, which is sparse. The query is encoded by the same way and submitted as test data. We apply sparse representation based classifier (SRC) to classify the query as a topic. The proposed approach shows satisfactory performance with 93% accuracy in classifying query.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the Dynamics of Username Changing Behavior on Twitter Smart filters for social retrieval Improving Urban Transportation through Social Media Analytics AMEO 2015: A dataset comprising AMCAT test scores, biodata details and employment outcomes of job seekers Learning from Gurus: Analysis and Modeling of Reopened Questions on Stack Overflow
×
引用
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