.png){kind=icon}
返回
The max-min hill-climbing Bayesian network structure learning algorithm
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-006-6889-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and search-and-score techniques in a principled and effective way. It first reconstructs the skeleton of a Bayesian network and then performs a Bayesian-scoring greedy hill-climbing search to orient the edges. In our extensive empirical evaluation MMHC outperforms on average and in terms of various metrics several prototypical and state-of-the-art algorithms, namely the PC, Sparse Candidate, Three Phase Dependency Analysis, Optimal Reinsertion, Greedy Equivalence Search, and Greedy Search. These are the first empirical results simultaneously comparing most of the major Bayesian network algorithms against each other. MMHC offers certain theoretical advantages, specifically over the Sparse Candidate algorithm, corroborated by our experiments. MMHC and detailed results of our study are publicly available at http://www.dsl-lab.org/supplements/mmhc_paper/mmhc_index.html.
Keyword:
Bayesian networks
graphical models
structure learning
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization通过微阵列杂交全面鉴定酿酒酵母的细胞周期调控基因
OAAI
OAAI分享收藏分享收藏Effects of Time-Restricted Eating on Weight Loss and Other Metabolic Parameters in Women and Men With Overweight and Obesity限时进食对超重和肥胖男性和女性体重减轻和其他代谢参数的影响OAAI
OAAI分享收藏
查看更多内容