Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models
Guillaume Marrelec,Habib Benali +1 more
9
TL;DR: A novel Bayesian strategy to deal with structure learning is proposed, which converts the problem of model selection into that of parameter estimation, and uses non-informative priors and asymptotic results to yield a posterior probability for independence graph supports in closed form.
read more
About: This article is published in Journal of Multivariate Analysis. The article was published on 01 Jul 2006. and is currently open access. The article focuses on the topics: Graphical model & Gibbs sampling.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Bayesian Alternative to Mutual Information for the Hierarchical Clustering of Dependent Random Variables
TL;DR: An encouraging result was first derived on simulations: the hierarchical clustering based on the log Bayes factor outperformed off-the-shelf clustering techniques as well as raw and normalized mutual information in terms of classification accuracy.
Building hyper Dirichlet processes for graphical models
TL;DR: In this paper, the authors explore graphical models based on a nonparametric family of distributions, developed from Dirichlet processes, and explore a prior over the graphical model if the random marginals also satisfy the independence constraints.
Automated Extraction of Mutual Independence Patterns Using Bayesian Comparison of Partition Models
Guillaume Marrelec,Alain Giron +1 more
TL;DR: In this article, a general Markov chain Monte Carlo (MCMC) algorithm is proposed to numerically approximate the posterior distribution on the space of all patterns of mutual independence in a Bayesian framework.
3
•Posted Content
Automated extraction of mutual independence patterns using Bayesian comparison of partition models
Guillaume Marrelec,Alain Giron +1 more
TL;DR: This article proposes a general Markov chain Monte Carlo (MCMC) algorithm to numerically approximate the posterior distribution on the space of all patterns of mutual independence and shows the relationship between such an approach and existing methods in the case of multivariate normal distributions as well as cross-classified multinomial distributions.
2
Graphe de connectivité cérébrale et longue dépendance
Florent Chatelain,Sophie Achard,Cédric Gouy-Pailler,Olivier Michel,Pierre-Olivier Amblard +4 more
- 05 Sep 2011
TL;DR: In this article, a decomposable graph based partial correlation matrix estimator is proposed for the analysis of time series exhibiting long memory properties, which is derived from the set of wavelet coefficients computed at a given scale; the obtained coefficient are asymptotically uncorrelated.
References
Maximum Entropy and Bayesian Methods
John Skilling,Sibusiso Sibisi +1 more
- 01 Jan 1989
Hyper Markov Laws in the Statistical Analysis of Decomposable Graphical Models
A. P. Dawid,Steffen L. Lauritzen +1 more
TL;DR: In this article, a hyper Markov law is defined as a probability distribution over a set of probability measures on a multivariate space that is concentrated on the set of Markov probabilities over some decomposable graph, and satisfies certain conditional independence restrictions related to that graph.
Bayesian Data Analysis
Andrew Gelman,John B. Carlin,Hal S. Stern,David B. Dunson,Aki Vehtari,Donald B. Rubin +5 more
TL;DR: Detailed notes on Bayesian Computation Basics of Markov Chain Simulation, Regression Models, and Asymptotic Theorems are provided.
589
Bayesian Data Analysis
TL;DR: In this paper, the authors present a Bayesian data analysis for Bayesian Data Analysis, which is based on Bayesian clustering and Bayesian analysis of Bayesian networks with Bayesian classifiers.
102