arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.05692stat.MLcs.AIcs.LG
收藏

贝叶斯网络结构学习的混合算法及其在多标号学习中的应用

A hybrid algorithm for Bayesian network structure learning with application to multi-label learning

Université de Lyon(里昂大学);Université Lyon 1(里昂第一大学);CNRS(法国国家科学研究中心)

Maxime Gasse, Alex Aussem, Haytham Elghazel

摘要:

提出了一种新的贝叶斯网络结构学习混合算法H2 PC。它首先重建贝叶斯网络的骨架,然后执行贝叶斯评分贪婪爬山搜索来定位边缘。该算法是基于分治的约束为基础的子程序学习的局部结构周围的目标变量。我们进行了两个系列的实验比较H2 PC对最大-最小爬山(MMHC),这是目前最强大的国家的最先进的贝叶斯网络结构学习算法。首先,我们使用八个著名的贝叶斯网络基准测试与各种数据大小来评估学习的算法返回的结构的质量。我们广泛的实验表明,H2 PC优于MMHC在良好的拟合新数据和质量的网络结构相对于真实的依赖结构的数据。其次,我们研究了H2 PC解决多标签学习问题的能力。我们提供的理论结果来表征和图形化识别所谓的最小标签幂集,出现在忠实条件下的联合分布的不可约因素。然后将多标签学习问题分解为一系列多类分类问题,其中每个多类变量编码一个标签幂集。H2 PC的全球分类精度超过10个多标签数据集,覆盖不同的应用领域相比,MMHC毫不逊色。总的来说,我们的实验支持这样的结论,即局部邻域归纳形式的H2 PC局部结构学习是一个理论上动机良好且经验有效的学习框架,非常适合多标签学习。H2 PC的源代码(R)以及用于实证测试的所有数据集都是公开的。

英文摘要:

We present a novel hybrid algorithm for Bayesian network structure learning, called H2PC. It first reconstructs the skeleton of a Bayesian network and then performs a Bayesian-scoring greedy hill-climbing search to orient the edges. The algorithm is based on divide-and-conquer constraint-based subroutines to learn the local structure around a target variable. We conduct two series of experimental comparisons of H2PC against Max-Min Hill-Climbing (MMHC), which is currently the most powerful state-of-the-art algorithm for Bayesian network structure learning. First, we use eight well-known Bayesian network benchmarks with various data sizes to assess the quality of the learned structure returned by the algorithms. Our extensive experiments show that H2PC outperforms MMHC in terms of goodness of fit to new data and quality of the network structure with respect to the true dependence structure of the data. Second, we investigate H2PC's ability to solve the multi-label learning problem. We provide theoretical results to characterize and identify graphically the so-called minimal label powersets that appear as irreducible factors in the joint distribution under the faithfulness condition. The multi-label learning problem is then decomposed into a series of multi-class classification problems, where each multi-class variable encodes a label powerset. H2PC is shown to compare favorably to MMHC in terms of global classification accuracy over ten multi-label data sets covering different application domains. Overall, our experiments support the conclusions that local structural learning with H2PC in the form of local neighborhood induction is a theoretically well-motivated and empirically effective learning framework that is well suited to multi-label learning. The source code (in R) of H2PC as well as all data sets used for the empirical tests are publicly available.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑