Critique of: “A Parallel Framework for Constraint-Based Bayesian Network Learning via Markov Blanket Discovery” by SCC Team From UC San Diego
Open Access
- 31 October 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 34 (6) , 1727-1730
Abstract
Bayesian networks (BNs) have become popular in recent years to describe natural phenomena in situations where causal linkages are important to understand. In order to get around the inherent non-tractability of learning BNs, Srivastava et al. propose a markov blanket discovery-based approach to learning in their paper titled ”A Parallel Framework for Constraint-based Bayesian Network Learning via Markov Blanket Discovery.” We are able to reproduce both the strong and weak scaling experiments from the paper up to 128 cores, and verify communication cost scaling for all three algorithms in the paper. We also introduce methodological improvements to weak scaling that show the paper's findings are unique to the methodology and not the datasets used. Slight variations in performance were observed due to differences in datasets, core count, and job scheduling.Keywords
This publication has 5 references indexed in Scilit:
- A comprehensive scoping review of Bayesian networks in healthcare: Past, present and futureArtificial Intelligence in Medicine, 2021
- A Parallel Framework for Constraint-Based Bayesian Network Learning via Markov Blanket Discovery2020
- Causality2009
- Matplotlib: A 2D Graphics EnvironmentComputing in Science & Engineering, 2007
- Bayesian networks in biomedicine and health-careArtificial Intelligence in Medicine, 2004