SeNMFk-SPLIT: large corpora topic modeling by semantic non-negative matrix factorization with automatic model selection

M. Eren, N. Solovyev, Manish Bhattarai, Kim Ø. Rasmussen, Charles Nicholas, B. Alexandrov
{"title":"SeNMFk-SPLIT: large corpora topic modeling by semantic non-negative matrix factorization with automatic model selection","authors":"M. Eren, N. Solovyev, Manish Bhattarai, Kim Ø. Rasmussen, Charles Nicholas, B. Alexandrov","doi":"10.1145/3558100.3563844","DOIUrl":null,"url":null,"abstract":"As the amount of text data continues to grow, topic modeling is serving an important role in understanding the content hidden by the overwhelming quantity of documents. One popular topic modeling approach is non-negative matrix factorization (NMF), an unsupervised machine learning (ML) method. Recently, Semantic NMF with automatic model selection (SeNMFk) has been proposed as a modification to NMF. In addition to heuristically estimating the number of topics, SeNMFk also incorporates the semantic structure of the text. This is performed by jointly factorizing the term frequency-inverse document frequency (TF-IDF) matrix with the co-occurrence/word-context matrix, the values of which represent the number of times two words co-occur in a predetermined window of the text. In this paper, we introduce a novel distributed method, SeNMFk-SPLIT, for semantic topic extraction suitable for large corpora. Contrary to SeNMFk, our method enables the joint factorization of large documents by decomposing the word-context and term-document matrices separately. We demonstrate the capability of SeNMFk-SPLIT by applying it to the entire artificial intelligence (AI) and ML scientific literature uploaded on arXiv.","PeriodicalId":146244,"journal":{"name":"Proceedings of the 22nd ACM Symposium on Document Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 22nd ACM Symposium on Document Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3558100.3563844","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

As the amount of text data continues to grow, topic modeling is serving an important role in understanding the content hidden by the overwhelming quantity of documents. One popular topic modeling approach is non-negative matrix factorization (NMF), an unsupervised machine learning (ML) method. Recently, Semantic NMF with automatic model selection (SeNMFk) has been proposed as a modification to NMF. In addition to heuristically estimating the number of topics, SeNMFk also incorporates the semantic structure of the text. This is performed by jointly factorizing the term frequency-inverse document frequency (TF-IDF) matrix with the co-occurrence/word-context matrix, the values of which represent the number of times two words co-occur in a predetermined window of the text. In this paper, we introduce a novel distributed method, SeNMFk-SPLIT, for semantic topic extraction suitable for large corpora. Contrary to SeNMFk, our method enables the joint factorization of large documents by decomposing the word-context and term-document matrices separately. We demonstrate the capability of SeNMFk-SPLIT by applying it to the entire artificial intelligence (AI) and ML scientific literature uploaded on arXiv.
SeNMFk-SPLIT:基于语义非负矩阵分解和自动模型选择的大型语料库主题建模
随着文本数据量的不断增长,主题建模在理解被大量文档隐藏的内容方面发挥着重要作用。一种流行的主题建模方法是非负矩阵分解(NMF),一种无监督机器学习(ML)方法。近年来,基于自动模型选择的语义NMF (Semantic NMF with automatic model selection, SeNMFk)作为NMF的一种改进被提出。除了启发式地估计主题的数量外,SeNMFk还结合了文本的语义结构。这是通过将术语频率逆文档频率(TF-IDF)矩阵与共现/词-上下文矩阵联合分解来实现的,共现/词-上下文矩阵的值表示两个词在文本的预定窗口中共现的次数。本文提出了一种适用于大型语料库的分布式语义主题抽取方法——SeNMFk-SPLIT。与senfk相反,我们的方法通过分别分解单词-上下文和术语-文档矩阵来实现大型文档的联合分解。我们通过将senmmk - split应用于上传在arXiv上的整个人工智能(AI)和机器学习科学文献来展示其能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信