Search Results for author: Kiattikun Chobtham

Found 8 papers, 0 papers with code

Tuning structure learning algorithms with out-of-sample and resampling strategies

no code implementations24 Jun 2023 Kiattikun Chobtham, Anthony C. Constantinou

One of the challenges practitioners face when applying structure learning algorithms to their data involves determining a set of hyperparameters; otherwise, a set of hyperparameter defaults is assumed.

Discovery and density estimation of latent confounders in Bayesian networks with evidence lower bound

no code implementations11 Jun 2022 Kiattikun Chobtham, Anthony C. Constantinou

Discovering and parameterising latent confounders represent important and challenging problems in causal structure learning and density estimation respectively.

Computational Efficiency Density Estimation +1

Hybrid Bayesian network discovery with latent variables by scoring multiple interventions

no code implementations20 Dec 2021 Kiattikun Chobtham, Anthony C. Constantinou, Neville K. Kitson

The algorithm assumes causal insufficiency in the presence of latent variables and produces a Partial Ancestral Graph (PAG).

Effective and efficient structure learning with pruning and model averaging strategies

no code implementations1 Dec 2021 Anthony C. Constantinou, Yang Liu, Neville K. Kitson, Kiattikun Chobtham, Zhigao Guo

Learning the structure of a Bayesian Network (BN) with score-based solutions involves exploring the search space of possible graphs and moving towards the graph that maximises a given objective function.

valid

A survey of Bayesian Network structure learning

no code implementations23 Sep 2021 Neville K. Kitson, Anthony C. Constantinou, Zhigao Guo, Yang Liu, Kiattikun Chobtham

This paper provides a comprehensive review of combinatoric algorithms proposed for learning BN structure from data, describing 74 algorithms including prototypical, well-established and state-of-the-art approaches.

Epidemiology

Bayesian network structure learning with causal effects in the presence of latent variables

no code implementations29 May 2020 Kiattikun Chobtham, Anthony C. Constantinou

Structure learning algorithms that assume causal insufficiency tend to reconstruct the ancestral graph of a BN, where bi-directed edges represent confounding and directed edges represent direct or ancestral relationships.

Cannot find the paper you are looking for? You can Submit a new open access paper.