A probabilistic topic model based on short distance Co-occurrences

被引:7
作者
Rahimi, Marziea [1 ]
Zahedi, Morteza [1 ]
Mashayekhi, Hoda [1 ]
机构
[1] Shahrood Univ Technol, Fac Comp Engn, Shahrood 3619995161, Iran
关键词
Probabilistic topic model; Latent Dirichlet Allocation; Document clustering; Context window; Local co-occurrence; Word order; NOISY TEXT; DISCOVERY; CLASSIFICATION;
D O I
10.1016/j.eswa.2022.116518
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A limitation of many probabilistic topic models such as Latent Dirichlet Allocation (LDA) is their inflexibility to use local contexts. As a result, these models cannot directly benefit from short-distance co-occurrences, which are more likely to be indicators of meaningful word relationships. Some models such as the Bigram Topic Model (BTM) consider local context by integrating language and topic models. However, due to taking the exact word order into account, such models suffer severely from sparseness. Some other models like Latent Dirichlet Co-Clustering (LDCC) try to solve the problem by adding another level of granularity assuming a document as a bag of segments, while ignoring the word order. In this paper, we introduce a new topic model which uses overlapping windows to encode local word relationships. In the proposed model, we assume a document is comprised of fixed-size overlapping windows, and formulate a new generative process accordingly. In the inference procedure, each word is sampled once in only a single window, while influencing the sampling of its other fellow co-occurring words in other windows. Word relationships are discovered in the document level, but the topic of each word is derived considering only its neighbor words in a window, to emphasize local word relationships. By using overlapping windows, without assuming an explicit dependency between adjacent words, we avoid ignoring the word order completely. The proposed model is straightforward, not severely prone to sparseness and as the experimental results show, produces more meaningful and more coherent topics compared to the three mentioned established models.
引用
收藏
页数:14
相关论文
共 88 条
[51]  
NEWTON MA, 1994, J R STAT SOC B, V56, P3
[52]  
Nguyen D.Q., 2015, Transactions of the Association for Computational Linguistics, V3, P299, DOI DOI 10.1162/TACL_A_00140
[53]   Text classification from labeled and unlabeled documents using EM [J].
Nigam, K ;
McCallum, AK ;
Thrun, S ;
Mitchell, T .
MACHINE LEARNING, 2000, 39 (2-3) :103-134
[54]  
Noji Hiroshi., 2013, Proceedings of the Conference on Empirical Methods on Natural Language Processing, P1180
[55]   An analysis of the coherence of descriptors in topic modeling [J].
O'Callaghan, Derek ;
Greene, Derek ;
Carthy, Joe ;
Cunningham, Padraig .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (13) :5645-5657
[56]   An improved ant algorithm with LDA-based representation for text document clustering [J].
Onan, Aytug ;
Bulut, Hasan ;
Korukoglu, Serdar .
JOURNAL OF INFORMATION SCIENCE, 2017, 43 (02) :275-292
[57]   Spatially Regularized Latent topic Model for Simultaneous object discovery and segmentation [J].
Ou, Wei ;
Xie, Zanfu ;
Lv, Zhihan .
2015 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2015): BIG DATA ANALYTICS FOR HUMAN-CENTRIC SYSTEMS, 2015, :2938-2943
[58]   Fast Supervised Topic Models for Short Text Emotion Detection [J].
Pang, Jianhui ;
Rao, Yanghui ;
Xie, Haoran ;
Wang, Xizhao ;
Wang, Fu Lee ;
Wong, Tak-Lam ;
Li, Qing .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (02) :815-828
[59]   Author Clustering with and Without Topical Features [J].
Panicheva, Polina ;
Litvinova, Olga ;
Litvinova, Tatiana .
SPEECH AND COMPUTER, SPECOM 2019, 2019, 11658 :348-358
[60]   Partially collapsed Gibbs sampling for latent Dirichlet allocation [J].
Park, Hongju ;
Park, Taeyoung ;
Lee, Yung-Seop .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 131 :208-218