一种综合改进的贝叶斯网络混合学习算法:多重复合记忆擦除
A Comprehensively Improved Hybrid Algorithm for Learning Bayesian Networks: Multiple Compound Memory Erasing
摘要:
利用贝叶斯网络来分析节点之间的因果关系是一个研究热点。现有的网络学习算法主要是基于约束和基于得分的网络生成方法。基于约束的方法主要是条件独立性(CI)检验的应用,但CI检验在高维小样本情况下的不准确性一直是基于约束的方法存在的问题。基于得分的方法利用得分函数和搜索策略寻找最优的候选网络结构,但搜索空间随着节点数的增加而增加过多,学习效率很低。本文提出了一种新的混合擦除算法MCME(multiple compound memory erasing)。该方法保留了前两种方法的优点,解决了上述CI测试的不足,并在方向判别阶段的评分函数上进行了创新。大量的实验表明,MCME具有优于或接近现有的一些算法的性能。
英文摘要:
Using a Bayesian network to analyze the causal relationship between nodes is a hot spot. The existing network learning algorithms are mainly constraint-based and score-based network generation methods. The constraint-based method is mainly the application of conditional independence (CI) tests, but the inaccuracy of CI tests in the case of high dimensionality and small samples has always been a problem for the constraint-based method. The score-based method uses the scoring function and search strategy to find the optimal candidate network structure, but the search space increases too much with the increase of the number of nodes, and the learning efficiency is very low. This paper presents a new hybrid algorithm, MCME (multiple compound memory erasing). This method retains the advantages of the first two methods, solves the shortcomings of the above CI tests, and makes innovations in the scoring function in the direction discrimination stage. A large number of experiments show that MCME has better or similar performance than some existing algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。