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...
Autori principali: | Bornn, L, Caron, F |
---|---|
Natura: | Journal article |
Lingua: | English |
Pubblicazione: |
2011
|
Documenti analoghi
Documenti analoghi
-
Bayesian nonparametric models on decomposable graphs
di: Caron, F, et al.
Pubblicazione: (2009) -
Decomposing the complete r -graph
di: Leader, Imre, et al.
Pubblicazione: (2018) -
Bayesian nonparametric models for bipartite graphs
di: Caron, F
Pubblicazione: (2012) -
Decomposable graphs and definitions with no quantifier alternation
di: Oleg Pikhurko, et al.
Pubblicazione: (2005-01-01) -
Recursively arbitrarily vertex-decomposable graphs
di: Olivier Baudon, et al.
Pubblicazione: (2012-01-01)