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...
المؤلفون الرئيسيون: | Bornn, L, Caron, F |
---|---|
التنسيق: | Journal article |
اللغة: | English |
منشور في: |
2011
|
مواد مشابهة
-
Bayesian nonparametric models on decomposable graphs
حسب: Caron, F, وآخرون
منشور في: (2009) -
Decomposing the complete r -graph
حسب: Leader, Imre, وآخرون
منشور في: (2018) -
Bayesian nonparametric models for bipartite graphs
حسب: Caron, F
منشور في: (2012) -
Decomposable graphs and definitions with no quantifier alternation
حسب: Oleg Pikhurko, وآخرون
منشور في: (2005-01-01) -
Recursively arbitrarily vertex-decomposable graphs
حسب: Olivier Baudon, وآخرون
منشور في: (2012-01-01)