Accelerated learning of latent tree models for topic detection and multidimensional clustering

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

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