Bayesian clustering in decomposable graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Bayesian Analysis Year : 2011

Bayesian clustering in decomposable graphs


In this paper we propose a class of prior distributions on decomposable graphs, allowing for improved modeling flexibility. While existing methods solely penalize the number of edges, the proposed work empowers practitioners to control clustering, level of separation, and other features of the graph. Emphasis is placed on a particular prior distribution which derives its motivation from the class of product partition models; the properties of this prior relative to existing priors is examined through theory and simulation. We then demonstrate the use of graphical models in the field of agriculture, showing how the proposed prior distribution alleviates the inflexibility of previous approaches in properly modeling the interactions between the yield of different crop varieties.

Dates and versions

inria-00487168 , version 1 (28-05-2010)



Luke Bornn, François Caron. Bayesian clustering in decomposable graphs. Bayesian Analysis, 2011, 6 (4), pp.829-845. ⟨10.1214/11-BA630⟩. ⟨inria-00487168⟩
56 View
0 Download



Gmail Facebook X LinkedIn More