Skip to Main content Skip to Navigation
Conference papers

Bayesian Nonparametric Models on Decomposable Graphs

Francois Caron 1, 2 Arnaud Doucet 3 
2 ALEA - Advanced Learning Evolutionary Algorithms
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5251
Abstract : Over recent years Dirichlet processes and the associated Chinese restaurant process (CRP) have found many applications in clustering while the Indian buffet process (IBP) is increasingly used to describe latent feature models. In the clustering case, we associate to each data point a latent allocation variable. These latent variables can share the same value and this induces a partition of the data set. The CRP is a prior distribution on such partitions. In latent feature models, we associate to each data point a potentially infinite number of binary latent variables indicating the possession of some features and the IBP is a prior distribution on the associated infinite binary matrix. These prior distributions are attractive because they ensure exchangeability (over samples). We propose here extensions of these models to decomposable graphs. These models have appealing properties and can be easily learned using Monte Carlo techniques.
Complete list of metadata
Contributor : Francois Caron Connect in order to contact the contributor
Submitted on : Friday, September 25, 2009 - 5:10:51 PM
Last modification on : Friday, February 4, 2022 - 3:23:47 AM


  • HAL Id : inria-00419966, version 1



Francois Caron, Arnaud Doucet. Bayesian Nonparametric Models on Decomposable Graphs. Neural Information Processing Systems, Dec 2009, Vancouver, Canada. ⟨inria-00419966⟩



Record views