The FEDHC Bayesian network learning algorithm

Abstract

The paper proposes a new hybrid Bayesian network learning algorithm, termed Forward Early Dropping Hill Climbing (FEDHC), devised to work with either continuous or categorical variables. Further, the paper manifests that the only implementation of MMHC in the statistical software \textit{R}, is prohibitively expensive and a new implementation is offered. Further, specifically for the case of continuous data, a robust to outliers version of FEDHC, that can be adopted by other BN learning algorithms, is proposed. The FEDHC is tested via Monte Carlo simulations that distinctly show it is computationally efficient, and produces Bayesian networks of similar to, or of higher accuracy than MMHC and PCHC. Finally, an application of FEDHC, PCHC and MMHC algorithms to real data, from the field of economics, is demonstrated using the statistical software \textit{R}.

This is a preprint of the paper published in Mathematics

References in corpus (5)

• Measuring and testing dependence by correlation of distances
• Kernel-based Conditional Independence Test and Application in Causal Discovery
• A Transformational Characterization of Equivalent Bayesian Network Structures
• The Chi-Square Test of Distance Correlation
• A Monte Carlo comparison of categorical tests of independence