The FEDHC Bayesian network learning algorithm
arXiv:2012.00113 · doi:10.3390/math10152604
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}.
arXiv commentThis is a preprint of the paper published in Mathematics
References in corpus (9)
- High-dimensional graphs and variable selection with the Lasso
- 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
- Fast robust correlation for high-dimensional data
- Robust Learning of Fixed-Structure Bayesian Networks
- Contagion in financial systems: A Bayesian network approach
- A Monte Carlo comparison of categorical tests of independence