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 条
[21]  
2-9
[22]   Fast and effective cluster-based information retrieval using frequent closed itemsets [J].
Djenouri, Youcef ;
Belhadi, Asma ;
Fournier-Viger, Philippe ;
Lin, Jerry Chun-Wei .
INFORMATION SCIENCES, 2018, 453 :154-167
[23]   An unsupervised topic-sentiment joint probabilistic model for detecting deceptive reviews [J].
Dong, Lu-yu ;
Ji, Shu-juan ;
Zhang, Chun-jin ;
Zhang, Qi ;
Chiu, DicksonK. W. ;
Qiu, Li-Qing ;
Li, Da .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 114 :210-223
[24]  
Dongyeop Kang, 2014, Machine Learning and Knowledge Discovery in Databases. European Conference, ECML PKDD 2014. Proceedings: LNCS 8724, P640, DOI 10.1007/978-3-662-44848-9_41
[25]   Interest-based recommendations for business intelligence users [J].
Drushku, Krista ;
Aligon, Julien ;
Labroche, Nicolas ;
Marcel, Patrick ;
Peralta, Veronika .
INFORMATION SYSTEMS, 2019, 86 :79-93
[26]   A segmented topic model based on the two-parameter Poisson-Dirichlet process [J].
Du, Lan ;
Buntine, Wray ;
Jin, Huidong .
MACHINE LEARNING, 2010, 81 (01) :5-19
[27]   Topic discovery in massive text corpora based on Min-Hashing [J].
Fuentes-Pineda, Gibran ;
Meza-Ruiz, Ivan, V .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 136 :62-72
[28]   Topics in semantic representation [J].
Griffiths, Thomas L. ;
Steyvers, Mark ;
Tenenbaum, Joshua B. .
PSYCHOLOGICAL REVIEW, 2007, 114 (02) :211-244
[29]   Finding scientific topics [J].
Griffiths, TL ;
Steyvers, M .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 :5228-5235
[30]   Authorship Attribution of Noisy Text Data With a Comparative Study of Clustering Methods [J].
Hamadache, Zohra ;
Sayoud, Halim .
INTERNATIONAL JOURNAL OF KNOWLEDGE AND SYSTEMS SCIENCE, 2018, 9 (02) :45-69