Approximate learning of high dimensional Bayesian network structures via
pruning of Candidate Parent Sets

v1v2 (latest)

Approximate learning of high dimensional Bayesian network structures via pruning of Candidate Parent Sets

8 June 2020

Anthony C. Constantinou

ArXiv (abs)PDF HTML

Papers citing "Approximate learning of high dimensional Bayesian network structures via pruning of Candidate Parent Sets"

9 / 9 papers shown

Title
Quotient Normalized Maximum Likelihood Criterion for Learning Bayesian Network Structures T. Silander Janne Leppä-aho Elias Jääsaari Teemu Roos 62 27 0 27 Aug 2024
Large-scale empirical validation of Bayesian Network structure learning algorithms with noisy data Anthony C. Constantinou Yang Liu Kiattikun Chobtham Zhi-gao Guo N. K. Kitson CML 55 62 0 18 May 2020
On Pruning for Score-Based Bayesian Network Structure Learning Alvaro H. C. Correia James Cussens Cassio de Campos 58 14 0 23 May 2019
An Empirical-Bayes Score for Discrete Bayesian Networks M. Scutari BDL 43 51 0 12 May 2016
Theory Refinement on Bayesian Networks Wray Buntine BDL 104 788 0 20 Mar 2013
A Construction of Bayesian Networks from Databases Based on an MDL Principle J. Suzuki 75 172 0 06 Mar 2013
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data David Heckerman D. Geiger D. M. Chickering TPM 117 3,983 0 27 Feb 2013
Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks M. Teyssier D. Koller 157 375 0 04 Jul 2012
A simple approach for finding the globally optimal Bayesian network structure T. Silander P. Myllymäki TPM 92 399 0 27 Jun 2012