首页 | 官方网站   微博 | 高级检索  
     

基于贝叶斯方法的决策树分类算法
引用本文:樊建聪,张问银,梁永全.基于贝叶斯方法的决策树分类算法[J].计算机应用,2005,25(12):2882-2884.
作者姓名:樊建聪  张问银  梁永全
作者单位:1. 山东科技大学,信息科学与工程学院,山东,青岛,266510
2. 临沂师范学院,计算机系,山东,临沂,276005
摘    要:针对数据挖掘的特点和本质,充分利用贝叶斯方法和决策树分类的优点,将贝叶斯的先验信息方法与决策树分类的信息增益方法相结合,提出了一种新的数据挖掘分类算法(BD1.0算法),并对此算法进行了设计和分析。实验分析表明,该算法可以处理不一致或者不完整数据等“脏数据”,比单纯使用贝叶斯方法或决策树方法具有更高的准确率,而且与C4.5算法具有近似的时间复杂度。

关 键 词:数据挖掘  分类  贝叶斯原理  决策树
文章编号:1001-9081(2005)12-2882-03
收稿时间:2005-06-06
修稿时间:2005-06-062005-08-14

Decision tree classification algorithm based on Bayesian method
FAN Jian-cong,ZHANG Wen-yin,LIANG Yong-quan.Decision tree classification algorithm based on Bayesian method[J].journal of Computer Applications,2005,25(12):2882-2884.
Authors:FAN Jian-cong  ZHANG Wen-yin  LIANG Yong-quan
Affiliation:1. College of Information Science and Technology, Shandong University of Science and Technology, Qingdao Shandong 266510, China; 2. Department of Computer, Linyi Normal University, Linyi Shandong 276005, China
Abstract:According to the characteristic and essence of data mining and taking advantage of Bayesian method, a new classification method named BD1.0 algorithm was presented. This method combined the prior information and information gain method of decision tree, The design and analysis of the algorithm was introduced too, The experiment results show that the algorithm can deal with dirty data such as incomplete data or inconsistent data, and it is more accurate than only useing Bayesian method or decision tree, It has approximate time complexity with C4.5 algorithm,
Keywords:data mining  classification  Bayesian principle  decision tree
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号