Analysis of the Max-Min Hill-Climbing Algorithm

Yue Wang · 2018

The Bayesian network is one of the effective tools for study of knowledge representation and casual reasoning in the conditions of uncertain in the field of Artificial Intelligence.How to construct a Bayesian network structure from data have become a hot point in recent study.Max-Min Hill-Climbing (MMHC) algorithm is a newly Bayesian network structure learning algorithm.After a lot of simulation experiments, it has been corroborated that MMHC outperforms on average and in terms of various metrics several prototypical and state-of-the-art algorithms.

Read the paper · More papers on PaperTik