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...
Main Authors: | Bornn, L, Caron, F |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2011
|
Similar Items
-
Bayesian nonparametric models on decomposable graphs
by: Caron, F, et al.
Published: (2009) -
Decomposing the complete r -graph
by: Leader, Imre, et al.
Published: (2018) -
Bayesian nonparametric models for bipartite graphs
by: Caron, F
Published: (2012) -
Decomposable graphs and definitions with no quantifier alternation
by: Oleg Pikhurko, et al.
Published: (2005-01-01) -
Recursively arbitrarily vertex-decomposable graphs
by: Olivier Baudon, et al.
Published: (2012-01-01)