Bayesian network structure learning with permutation tests

DOI10.1080/03610926.2011.593284zbMATH Open1296.62044arXiv1101.5184OpenAlexW2169030506MaRDI QIDQ3167859FDOQ3167859

Authors: Marco Scutari, Adriana Brogini 

Publication date: 29 October 2012

Published in: Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Abstract: In literature there are several studies on the performance of Bayesian network structure learning algorithms. The focus of these studies is almost always the heuristics the learning algorithms are based on, i.e. the maximisation algorithms (in score-based algorithms) or the techniques for learning the dependencies of each variable (in constraint-based algorithms). In this paper we investigate how the use of permutation tests instead of parametric ones affects the performance of Bayesian network structure learning from discrete data. Shrinkage tests are also covered to provide a broad overview of the techniques developed in current literature.

Full work available at URL: https://arxiv.org/abs/1101.5184

Recommendations

• Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms
• Bayesian network structure learning: hybridizing complete search with independence tests
• Efficient structure learning of Bayesian networks using constraints
• Learning Bayesian networks for discrete data
• Learning Bayesian networks: The combination of knowledge and statistical data

zbMATH Keywords

Bayesian networkspermutation testsconditional independence testsshrinkage tests

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Bayesian inference (62F15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cites Work

• Introduction to Graphical Modelling
• Estimating the dimension of a model
• Testing Statistical Hypotheses
• Title not available (Why is that?)
• Title not available (Why is that?)
• The max-min hill-climbing Bayesian network structure learning algorithm
• Probabilistic graphical models.
• Title not available (Why is that?)

Cited In (5)

• Efficient feature selection using shrinkage estimators
• Improving the efficiency of genomic selection
• Testing Bayesian Networks
• Test data engineering. Latent rank analysis, biclustering, and Bayesian network
• Squared error-based shrinkage estimators of discrete probabilities and their application to variable selection

Uses Software

• R
• bnlearn

This page was built for publication: Bayesian network structure learning with permutation tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167859)