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...
Glavni autori: | Bornn, L, Caron, F |
---|---|
Format: | Journal article |
Jezik: | English |
Izdano: |
2011
|
Slični predmeti
-
Bayesian nonparametric models on decomposable graphs
od: Caron, F, i dr.
Izdano: (2009) -
Decomposing the complete r -graph
od: Leader, Imre, i dr.
Izdano: (2018) -
Bayesian nonparametric models for bipartite graphs
od: Caron, F
Izdano: (2012) -
Decomposable graphs and definitions with no quantifier alternation
od: Oleg Pikhurko, i dr.
Izdano: (2005-01-01) -
Recursively arbitrarily vertex-decomposable graphs
od: Olivier Baudon, i dr.
Izdano: (2012-01-01)