Document Representations to Improve Topic Modelling

P. V. Poojitha, R. Menon
{"title":"Document Representations to Improve Topic Modelling","authors":"P. V. Poojitha, R. Menon","doi":"10.2139/ssrn.3733546","DOIUrl":null,"url":null,"abstract":"Each and every day we are collecting lots of information from web applications. So it is difficult to understand or detect what the whole information is all about. To detect, understand and summarise the whole information we need some specific tools and techniques like topic modelling which helps to analyze and identify the crisp of the data. This paper implements the sparsity based document representation to improve Topic Modeling, it organizes the data with meaningful structure by using machine learning algorithms like LDA(Latent Dirichlet Allocation) and OMP(Orthogonal Matching Pursuit) algorithms. It identifies a documents belongs to which topic as well as similarity between documents in an existing dictionary. The OMP(Orthogonal Matching Pursuit) algorithm is the best algorithm for sparse approximation With better accuracy. OMP(Orthogonal Matching Pursuit) algorithm can identify the topics to which the input document[Y] is mostly related to across a large collection of text documents present in a dictionary.","PeriodicalId":346706,"journal":{"name":"2020 International Conference on Software Security and Assurance (ICSSA)","volume":"29 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Software Security and Assurance (ICSSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3733546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Each and every day we are collecting lots of information from web applications. So it is difficult to understand or detect what the whole information is all about. To detect, understand and summarise the whole information we need some specific tools and techniques like topic modelling which helps to analyze and identify the crisp of the data. This paper implements the sparsity based document representation to improve Topic Modeling, it organizes the data with meaningful structure by using machine learning algorithms like LDA(Latent Dirichlet Allocation) and OMP(Orthogonal Matching Pursuit) algorithms. It identifies a documents belongs to which topic as well as similarity between documents in an existing dictionary. The OMP(Orthogonal Matching Pursuit) algorithm is the best algorithm for sparse approximation With better accuracy. OMP(Orthogonal Matching Pursuit) algorithm can identify the topics to which the input document[Y] is mostly related to across a large collection of text documents present in a dictionary.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
改进主题建模的文档表示
我们每天都在从网络应用程序中收集大量的信息。因此,很难理解或检测到整个信息的全部内容。为了检测、理解和总结整个信息,我们需要一些特定的工具和技术,如主题建模,这有助于分析和识别数据的清晰度。本文实现了基于稀疏度的文档表示来改进主题建模,利用LDA(Latent Dirichlet Allocation)和OMP(Orthogonal Matching Pursuit)算法等机器学习算法,将数据组织成有意义的结构。它标识文档属于哪个主题,以及现有字典中文档之间的相似性。正交匹配追踪(OMP)算法是稀疏逼近的最佳算法,具有较好的精度。OMP(正交匹配追踪)算法可以在字典中存在的大量文本文档中识别与输入文档[Y]最相关的主题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Security Analysis of SOHO Wi-Fi routers Document Representations to Improve Topic Modelling Why Compliance is needed for Internet of Things? An Internet of Things (IoT) Security Assessment for Households Assessing the sovereignty and security of the Austrian internet
×
引用
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