Learning topic hierarchies by tree-directed latent variable models
From MaRDI portal
Cites work
- 10.1162/jmlr.2003.3.4-5.993
- A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics
- A spectral algorithm for latent Dirichlet allocation
- A unified approach to hierarchical random measures
- Bayesian hierarchical model for the prediction of football results
- Bayesian pyramids: identifiable multilayer discrete latent structure models for discrete data
- Borrowing strengh in hierarchical Bayes: posterior concentration of the Dirichlet base measure
- Convergence of latent mixing measures in finite and infinite mixture models
- Convergence rates of latent topic models under relaxed identifiability conditions
- Distribution theory for hierarchical processes
- Finite-dimensional Discrete Random Structures and Bayesian Clustering
- Flexible clustering via hidden hierarchical Dirichlet priors
- Fundamentals of nonparametric Bayesian inference
- Hierarchical Dirichlet Processes
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Inference of global clusters from locally distributed data
- Learning topic models -- going beyond SVD
- Learning Topic Models: Identifiability and Finite-Sample Analysis
- Nonnegative matrix factorization via archetypal analysis
- On posterior contraction of parameters and interpretability in Bayesian mixture modeling
- Optimal estimation of sparse topic models
- Posterior contraction of the population polytope in finite admixture models
- Scalable Bayesian computation for crossed and nested hierarchical models
- The nested Chinese restaurant process and Bayesian nonparametric inference of topic hierarchies
- Using SVD for Topic Modeling
This page was built for publication: Learning topic hierarchies by tree-directed latent variable models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254309)
