期刊文献+

TAN分类器及其应用 被引量:1

TAN Classifier and Its Applications
下载PDF
导出
摘要 主要介绍了贝叶斯网络分类器中的TAN分类器的模型、构造方法及分类方法.通过对参加2006年6月大学英语四级考试同学的学习情况及考试成绩的问卷调查获得数据,采用Hold-out检测方法,即取出其中2/3的数据集作为训练集,另外1/3数据集作为测试集,构造TAN分类器,检验分类器的分类效果.并通过与朴素贝叶斯分类器分类效果的对比实验,证明TAN分类器是分类效果较好的分类器. This paper mainly introduces the TAN classifier model, its building method and class method. The checking data cone from analyzing the questionnaire of the study circumstance and examinational grades of students who take part in the band four examinations of English in June 2006. Adopt Hold-out checking method to build TAN classifier and check classifier's results. And compared with Naive Bayes network, TAN classifier is testified to be an efficient one.
作者 邓甦 付长贺
出处 《沈阳师范大学学报(自然科学版)》 CAS 2007年第2期150-152,共3页 Journal of Shenyang Normal University:Natural Science Edition
关键词 分类 贝叶斯网络 TAN分类器 英语四级考试 class Bayesian network TAN classifier Band Four Examinations of English
  • 相关文献

参考文献4

二级参考文献33

  • 1David Maxwell. Learning equivalence classes of Bayesian - network structures[ J ]. Machine Learning, 2002 (2) :445 - 498.
  • 2Nir Friedman. Bayesian network classifiers[ J ]. Machine Learming, 1997,29:131-163.
  • 3Marco Ramcni. Robust Bayes clasifiers[J]. Artificial Intelligence,2001,125(1,2) :209- 226.
  • 4David Heckerman. Learning Bayesian networks: the combination of knowledge and statistical data[J ]. Machine Learning, 1995,20:197- 243.
  • 5Cheng Jie. Learning Bayesian networks from data: an information - theory based approach[J]. Artificial Intelligence,2002,137(1,2) :43-90.
  • 6Wong M L. Using evolutionary programming and mininum description length prindple for data mining of Bayesian networks[ J ]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1999,21 ( 2 ) : 174-178.
  • 7Ramoni M, Sebastiani P. Robust Bayes classifiers[J]. Artificial Intelligence, 2001, 125(1-2): 209-226.
  • 8Friedman N, Geiger D, Goldszmidt M. Bayesian network classifiers[J]. Machine Learning, 1997, 29:131-161.
  • 9Xiang Y, Wong S K M, Cercone N. A 'Microscopic' study of minimum entropy search in learning decomposable Markov networks[J]. Machine Learning. 1997, 26, 65-92.
  • 10Karger D, Srebro N. Learning Markov networks: Maximum bounded tree-width graphs[C]. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001.

共引文献82

同被引文献4

引证文献1

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部