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...
Autors principals: | Bornn, L, Caron, F |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
2011
|
Ítems similars
-
Bayesian nonparametric models on decomposable graphs
per: Caron, F, et al.
Publicat: (2009) -
Decomposing the complete r -graph
per: Leader, Imre, et al.
Publicat: (2018) -
Bayesian nonparametric models for bipartite graphs
per: Caron, F
Publicat: (2012) -
Decomposable graphs and definitions with no quantifier alternation
per: Oleg Pikhurko, et al.
Publicat: (2005-01-01) -
Recursively arbitrarily vertex-decomposable graphs
per: Olivier Baudon, et al.
Publicat: (2012-01-01)