scholarly journals A Novel Document Generation Process for Topic Detection Based on Hierarchical Latent Tree Models

Author(s):  
Peixian Chen ◽  
Zhourong Chen ◽  
Nevin L. Zhang
2017 ◽  
Vol 250 ◽  
pp. 105-124 ◽  
Author(s):  
Peixian Chen ◽  
Nevin L. Zhang ◽  
Tengfei Liu ◽  
Leonard K.M. Poon ◽  
Zhourong Chen ◽  
...  

2019 ◽  
Vol 26 (5) ◽  
pp. 531-549
Author(s):  
Chuan Wu ◽  
Evangelos Kanoulas ◽  
Maarten de Rijke

AbstractEntities play an essential role in understanding textual documents, regardless of whether the documents are short, such as tweets, or long, such as news articles. In short textual documents, all entities mentioned are usually considered equally important because of the limited amount of information. In long textual documents, however, not all entities are equally important: some are salient and others are not. Traditional entity topic models (ETMs) focus on ways to incorporate entity information into topic models to better explain the generative process of documents. However, entities are usually treated equally, without considering whether they are salient or not. In this work, we propose a novel ETM, Salient Entity Topic Model, to take salient entities into consideration in the document generation process. In particular, we model salient entities as a source of topics used to generate words in documents, in addition to the topic distribution of documents used in traditional topic models. Qualitative and quantitative analysis is performed on the proposed model. Application to entity salience detection demonstrates the effectiveness of our model compared to the state-of-the-art topic model baselines.


2018 ◽  
Vol 92 ◽  
pp. 392-409
Author(s):  
Leonard K.M. Poon ◽  
April H. Liu ◽  
Nevin L. Zhang

2013 ◽  
Vol 98 (1-2) ◽  
pp. 301-330 ◽  
Author(s):  
Teng-Fei Liu ◽  
Nevin L. Zhang ◽  
Peixian Chen ◽  
April Hua Liu ◽  
Leonard K. M. Poon ◽  
...  

2008 ◽  
Vol 32 ◽  
pp. 879-900 ◽  
Author(s):  
Y. Wang ◽  
N. L. Zhang ◽  
T. Chen

We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and when online, make inference with the LTM instead of the original BN. Because LTMs are tree-structured, inference takes linear time. In the meantime, they can represent complex relationship among leaf nodes and hence the approximation accuracy is often good. Empirical evidence shows that our method can achieve good approximation accuracy at low online computational cost.


Sign in / Sign up

Export Citation Format

Share Document