Hierarchical Topic Models and the Nested Chinese Restaurant Process

Abstract

We address the problem of learning topic hierarchies from data. The model selection problem in this domain is daunting—which of the large collection of possible trees to use? We take a Bayesian approach, generating an appropriate prior via a distribution on partitions that we refer to as the nested Chinese restaurant process. This nonparametric prior allows arbitrarily large branching factors and readily accommodates growing data collections. We build a hierarchical topic model by combining this prior with a likelihood that is based on a hierarchical variant of latent Dirichlet allocation. We illustrate our approach on simulated data and with an application to the modeling of NIPS abstracts.

Extracted Key Phrases

5 Figures and Tables

050100'04'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

744 Citations

Semantic Scholar estimates that this publication has received between 635 and 875 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Blei2003HierarchicalTM, title={Hierarchical Topic Models and the Nested Chinese Restaurant Process}, author={David M. Blei and Thomas L. Griffiths and Michael I. Jordan and Joshua B. Tenenbaum}, booktitle={NIPS}, year={2003} }