On the classification performance of TAN and general Bayesian networks

被引:98
作者
Madden, Michael G. [1 ]
机构
[1] Natl Univ Ireland, Coll Engn & Informat, Galway, Ireland
关键词
Bayesian networks; TAN; Naive Bayes; Classification; Inductive learning; Parameter estimation; CLASSIFIERS;
D O I
10.1016/j.knosys.2008.10.006
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
Over a decade ago, Friedman et al. introduced the Tree Augmented Naive Bayes (TAN) classifier, with experiments indicating that it significantly outperformed Naive Bayes (NB) in terms of classification accuracy, whereas general Bayesian network (GBN) classifiers performed no better than NB. This paper challenges those claims, using a careful experimental analysis to show that GBN classifiers significantly outperform NB on datasets analyzed, and are comparable to TAN performance. It is found that the poor performance reported by Friedman et al. are not attributable to the GBN per se, but rather to their use of simple empirical frequencies to estimate GBN parameters, whereas basic parameter smoothing (used in their TAN analyses but not their GBN analyses) improves GBN performance significantly. It is concluded that, while GBN classifiers may have some limitations, they deserve greater attention, particularly in domains where insight into classification decisions, as well as good accuracy, is required. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:489 / 495
页数:7
相关论文
共 24 条
[1]
[Anonymous], 142004 U WAIK COMP S
[2]
[Anonymous], 2004, P 21 INT C MACH LEAR
[3]
[Anonymous], 1995, P 12 INT C MACHINE L
[4]
[Anonymous], 2006, P 22 C UNCERTAINTY A
[5]
[Anonymous], 2004, P 21 INT C MACH LEAR
[6]
Asuncion Arthur, 2007, Uci machine learning repository
[7]
BAESENS B, 2002, P 2002 INT C PATT RE
[8]
BUNTINE W, 1991, P 7 INT C UNC ART IN
[9]
TAN classifiers based on decomposable distributions [J].
Cerquides, J ;
De Mantaras, RL .
MACHINE LEARNING, 2005, 59 (03) :323-354
[10]
CHEN J, 2001, P 14 CAN C ART INT