Distance dependent Chinese restaurant processes

By David M. Blei, Peter I. Frazier. International Conference on Machine Learning, 2009

405 citations recorded by the source corpus.

We develop the distance dependent Chinese restaurant process (CRP), a flexible class of distributions over partitions that allows for non-exchangeability. This class can be used to model dependencies between data in infinite clustering models, including dependencies across time or space. We examine the properties of the distance dependent CRP, discuss its connections to Bayesian nonparametric mixture models, and derive a Gibbs sampler for both observed and mixture settings. We study its performance with time-dependent models and three text corpora. We show that relaxing the assumption of exchangeability with distance dependent CRPs can provide a better fit to sequential data. We also show its alternative formulation of the traditional CRP leads to a faster-mixing Gibbs sampling algorithm than the one based on the original formulation.

View Paper: https://www.semanticscholar.org/paper/2b2b87922d343d22c4872f2047f6ff6f88de6a43

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

  1. Yura N. Perov
  2. Tuan Anh Le
  3. Frank D. Wood
  4. Khanh Nguyen
  5. Brendan T. O'Connor
  6. Jan-Willem van de Meent
  7. Dan Hendrycks
  8. Brooks Paige

Citations in the corpus