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...
Huvudupphovsmän: | Bornn, L, Caron, F |
---|---|
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
2011
|
Liknande verk
Liknande verk
-
Bayesian nonparametric models on decomposable graphs
av: Caron, F, et al.
Publicerad: (2009) -
Decomposing the complete r -graph
av: Leader, Imre, et al.
Publicerad: (2018) -
Bayesian nonparametric models for bipartite graphs
av: Caron, F
Publicerad: (2012) -
Decomposable graphs and definitions with no quantifier alternation
av: Oleg Pikhurko, et al.
Publicerad: (2005-01-01) -
Recursively arbitrarily vertex-decomposable graphs
av: Olivier Baudon, et al.
Publicerad: (2012-01-01)