Distance Dependent Chinese Restaurant Processes

Details Distance Dependent Chinese Restaurant Processes Distance Dependent Chinese Restaurant Processes

2009-10-06

arxiv.org/abs/0910.1022v3

Statistics

Machine Learning

Scientific paper

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 many kinds of 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 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.

Affiliated with

Also associated with

No associations

Rating

Distance Dependent Chinese Restaurant Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distance Dependent Chinese Restaurant Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance Dependent Chinese Restaurant Processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357810