Sciweavers

14 search results - page 1 / 3
» Fast collapsed gibbs sampling for latent dirichlet allocatio...
Sort
View
KDD
2008
ACM
152views Data Mining» more  KDD 2008»
14 years 4 months ago
Fast collapsed gibbs sampling for latent dirichlet allocation
Ian Porteous, David Newman, Alexander T. Ihler, Ar...
JMLR
2010
121views more  JMLR 2010»
12 years 11 months ago
Efficient Collapsed Gibbs Sampling for Latent Dirichlet Allocation
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...
Han Xiao, Thomas Stibor
ICML
2009
IEEE
14 years 5 months ago
Incorporating domain knowledge into topic modeling via Dirichlet Forest priors
Users of topic modeling methods often have knowledge about the composition of words that should have high or low probability in various topics. We incorporate such domain knowledg...
David Andrzejewski, Xiaojin Zhu, Mark Craven
NIPS
2008
13 years 6 months ago
Relative Performance Guarantees for Approximate Inference in Latent Dirichlet Allocation
Hierarchical probabilistic modeling of discrete data has emerged as a powerful tool for text analysis. Posterior inference in such models is intractable, and practitioners rely on...
Indraneel Mukherjee, David M. Blei
SLSFS
2005
Springer
13 years 10 months ago
Discrete Component Analysis
Abstract. This article presents a unified theory for analysis of components in discrete data, and compares the methods with techniques such as independent component analysis, non-...
Wray L. Buntine, Aleks Jakulin