Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Partition MCMC for Inference on Acyclic Digraphs
by
Moffa, Giusi
, Kuipers, Jack
in
Algorithms
/ Bayesian analysis
/ Bayesian networks
/ Bayesian theory
/ Bias
/ Combinatorial analysis
/ Computer simulation
/ Convergence
/ Digraphs
/ equations
/ Graph theory
/ Graphical models
/ Graphical representations
/ Graphs
/ Inference
/ Learning
/ Machine learning
/ Markov analysis
/ Markov chain
/ Markov chains
/ Matrices
/ MCMC
/ Modularity
/ Monte Carlo simulation
/ parents
/ Partition
/ Property
/ Regression analysis
/ Reversal
/ Statistical analysis
/ Statistical inference
/ Statistical methods
/ Statistics
/ Structure learning
/ Theory and Methods
2017
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Partition MCMC for Inference on Acyclic Digraphs
by
Moffa, Giusi
, Kuipers, Jack
in
Algorithms
/ Bayesian analysis
/ Bayesian networks
/ Bayesian theory
/ Bias
/ Combinatorial analysis
/ Computer simulation
/ Convergence
/ Digraphs
/ equations
/ Graph theory
/ Graphical models
/ Graphical representations
/ Graphs
/ Inference
/ Learning
/ Machine learning
/ Markov analysis
/ Markov chain
/ Markov chains
/ Matrices
/ MCMC
/ Modularity
/ Monte Carlo simulation
/ parents
/ Partition
/ Property
/ Regression analysis
/ Reversal
/ Statistical analysis
/ Statistical inference
/ Statistical methods
/ Statistics
/ Structure learning
/ Theory and Methods
2017
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Partition MCMC for Inference on Acyclic Digraphs
by
Moffa, Giusi
, Kuipers, Jack
in
Algorithms
/ Bayesian analysis
/ Bayesian networks
/ Bayesian theory
/ Bias
/ Combinatorial analysis
/ Computer simulation
/ Convergence
/ Digraphs
/ equations
/ Graph theory
/ Graphical models
/ Graphical representations
/ Graphs
/ Inference
/ Learning
/ Machine learning
/ Markov analysis
/ Markov chain
/ Markov chains
/ Matrices
/ MCMC
/ Modularity
/ Monte Carlo simulation
/ parents
/ Partition
/ Property
/ Regression analysis
/ Reversal
/ Statistical analysis
/ Statistical inference
/ Statistical methods
/ Statistics
/ Structure learning
/ Theory and Methods
2017
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Partition MCMC for Inference on Acyclic Digraphs
2017
Request Book From Autostore
and Choose the Collection Method
Overview
Acyclic digraphs are the underlying representation of Bayesian networks, a widely used class of probabilistic graphical models. Learning the underlying graph from data is a way of gaining insights about the structural properties of a domain. Structure learning forms one of the inference challenges of statistical graphical models. Markov chain Monte Carlo (MCMC) methods, notably structure MCMC, to sample graphs from the posterior distribution given the data are probably the only viable option for Bayesian model averaging. Score modularity and restrictions on the number of parents of each node allow the graphs to be grouped into larger collections, which can be scored as a whole to improve the chain's convergence. Current examples of algorithms taking advantage of grouping are the biased order MCMC, which acts on the alternative space of permuted triangular matrices, and nonergodic edge reversal moves. Here, we propose a novel algorithm, which employs the underlying combinatorial structure of DAGs to define a new grouping. As a result convergence is improved compared to structure MCMC, while still retaining the property of producing an unbiased sample. Finally, the method can be combined with edge reversal moves to improve the sampler further. Supplementary materials for this article are available online.
This website uses cookies to ensure you get the best experience on our website.