Effective and efficient structure learning with pruning and model averaging strategies
type: Item
instance of: scholarly article
title: Effective and efficient structure learning with pruning and model averaging strategies
author: Anthony C. Constantinou
author: Yang Liu
author: Neville K. Kitson
author: Kiattikun Chobtham
author: Zhigao Guo
published in: International Journal of Approximate Reasoning
publication date: 2022-12-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/2112.00398
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 7629285
zbMATH Keywords: Bayesian networks
zbMATH Keywords: directed acyclic graphs
zbMATH Keywords: Markov equivalence
zbMATH Keywords: noisy data
zbMATH Keywords: probabilistic graphical models
describes a project that uses: TETRAD
describes a project that uses: bnlearn
MaRDI profile type: Publication
OpenAlex ID: W4226399656
cites work: 10.1162/153244302760200696
cites work: Q5249586
cites work: A Gibbs sampler for learning DAGs
cites work: Learning Bayesian networks: The combination of knowledge and statistical data
cites work: Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
cites work: Ancestral graph Markov models.
cites work: Causation, prediction, and search
cites work: The max-min hill-climbing Bayesian network structure learning algorithm
cites work: On scoring maximal ancestral graphs with the max-min hill climbing algorithm
DOI: 10.1016/J.IJAR.2022.09.016
description: scientific article; zbMATH DE number 7629285