计算机应用 ›› 2014, Vol. 34 ›› Issue (4): 1083-1088.DOI: 10.11772/j.issn.1001-9081.2014.04.1083

• 人工智能 • 上一篇    下一篇

多维贝叶斯网络分类器结构学习算法

傅顺开,Sein Minn,李志强   

  1. 华侨大学 计算机科学与技术学院,福建 厦门 361021
  • 收稿日期:2013-09-30 修回日期:2013-12-21 出版日期:2014-04-01 发布日期:2014-04-29
  • 通讯作者: 傅顺开
  • 作者简介:傅顺开(1978-),男,福建仙游人,讲师,博士,主要研究方向:数据挖掘、移动互联网;
    Sein Minn(1990-),男,缅甸人,硕士研究生,主要研究方向:数据挖掘;
    李志强(1990-),男,福建安溪人,硕士研究生,主要研究方向:数据挖掘。
  • 基金资助:

    国家自然科学基金资助项目;中央高校基本科研业务费专项资金资助项目;厦门科技计划基金资助项目;华侨大学科研基金资助项目

Structure learning algorithm for general multi-dimensional Bayesian network classifiers

FU Shunkai,SEIN Minn,LI Zhiqiang   

  1. College of Computer Science and Technology, Huaqiao University, Xiamen Fujian 361021, China
  • Received:2013-09-30 Revised:2013-12-21 Online:2014-04-01 Published:2014-04-29
  • Contact: FU Shunkai
  • Supported by:

    ; the Scientific Research Foundation of Huaqiao University

摘要:

传统多维贝叶斯网络分类器(MBNC)限制其模型结构必须是二分的,通过移除该限制可得到更准确的对关联分布建模的通用MBNC(GMBNC)。基于局部马尔可夫毯的迭代搜索,提出可准确学习GMBNC的算法IPC-GMBNC。该算法由于无需学习全局贝叶斯网络(BN),可扩展性强。基于已知贝叶斯网络模型而随机生成的数据上所执行的实验显示,IPC-GMBNC可有效推导出目标结构;而且与传统的全局结构学习算法PC相比,IPC-GMBNC可节省大量的计算量。

Abstract:

The conventional Multi-dimensional Bayesian Network Classifier (MBNC) requires its structure be bi-partitie. Removing this constraint can result into a new tool named General MBNC (GMBNC), and it enables us to model the underlying joint distribution more correctly. Based on iterative local search of Markov blankets, an algorithm called IPC-GMBNC was proposed to induce the exact structure of GMBNC. The proposed algorithm has good scalability because it does not need to recover the global Bayesian Network (BN) first. The experiments on samples generated from known Bayesian network structures indicate that IPC-GMBNC is effective, and it brings great reduction on computing complexity compared to global search approach, e.g. PC algorithm.

中图分类号: