Critique of “A Parallel Framework for Constraint-Based Bayesian Network Learning via Markov Blanket Discovery” by SCC Team from ShanghaiTech University

Guancheng Li,Songhui Cao,Chuyi Zhao,Siyuan Zhang, Yuchen Ji,Haotian Jing, Zecheng Li, Jiajun Cheng,Yiwei Yang,Shu Yin

IEEE Transactions on Parallel and Distributed Systems（2022）

引用 1|浏览0

暂无评分

摘要

In SC20, (Srivastava et al. 2020) proposed a Parallel F ram ework for B ayesian Le arning, or ramBLe, for short, which is a highly parallel and efficient framework for learning the structure of Bayesian Networks (BNs) from samples, There was a discrepancy in Bibliography in the PDF and the source file. We have followed the source file. ?> particularly large genome-scale networks. As part of our participation in the SC21 Student Cluster Competition, our task was to verify conclusions from the original work (Srivastava et al. 2020). Here we present the outcome of our experiments, which were performed on a four-node cluster from the Oracle Cloud HPC platform. We reproduce the numerical results from (Srivastava et al. 2020), namely the algorithm's performance and scaling behavior using MPI and different Python and Boost libraries on the Oracle cloud.

查看译文

关键词

Case studies in scientific applications,usability testing

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要