Nothing Special   »   [go: up one dir, main page]

Skip to main content

On the Classification Performance of TAN and General Bayesian Networks

  • Conference paper
Research and Development in Intelligent Systems XXV (SGAI 2008)

Abstract

Over a decade ago, Friedmanet al. introduced the Tree Augmented Naïve Bayes (TAN) classifier, with experiments indicating that it significantly outperformed Naïve 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Baesens, B., Egmont-Petersen, M., Castelo, R. and Vanthienen, J. (2002) Learning Bayesian network classifiers for credit scoring using Markov Chain Monte Carlo search. Proc. 2002 International Congress on Pattern Recognition, IEEE Computer Society.

    Google Scholar 

  2. Asuncion, A. & Newman, D.J. (2007). UCI Machine Learning Repository. http://www.ics.uci.edu/~mlearn/MLRepository.html. University of California, Irvine.

    Google Scholar 

  3. Bouckaert, R.R. (2004): Bayesian networks in Weka. Technical Report 14/2004. Computer Science Department. University of Waikato.

    Google Scholar 

  4. Bouckaert, R.R. (2004): Estimating Replicability of Classifier Learning Experiments. Proc. 21st International Conference on Machine Learning.

    Google Scholar 

  5. Buntine, W.(1991). Theory Refinement on Bayesian Networks. Proc. 7th International Conference on Uncertainty in Artificial Intelligence.

    Google Scholar 

  6. Cerquides, J. and de Mántaras, R. (2005). TAN Classifiers Based on Decomposable Distributions. Machine Learning Vol. 59, pp 323–354.

    Article  MATH  Google Scholar 

  7. Cheng, J. and Greiner, R. (2001). Learning Bayesian Belief Network Classifiers: Algorithms and System. Proc. 14th Canadian Conference on Artificial Intelligence.

    Google Scholar 

  8. Cheng, J., Greiner, R., Kelly, J., Bell, D. and Liu, W. (2002). Learning Belief Networks from Data: An Information Theory Based Approach. Artificial Intelligence, Vol. 137, pp 43–90.

    Article  MATH  MathSciNet  Google Scholar 

  9. Chickering, D.M. (2002). Optimal Structure Identification with Greedy Search. Journal of Machine Learning Research, Vol. 3, pp 507–554.

    Article  MathSciNet  Google Scholar 

  10. Chickering, D.M. and Meek, C. (2006). On the Incompatibility of Faithfulness and Monotone DAG Faithfulness. Artificial Intelligence, Vol. 170, pp 653–666.

    Article  MathSciNet  Google Scholar 

  11. Cooper, G.F. (1990). The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks. Artificial Intelligence, Vol. 42, pp 393–405.

    Article  MATH  MathSciNet  Google Scholar 

  12. Cooper, G.F. and Herskovits, E. (1992). A Bayesian Method for the Induction of Probabilistic Networks from Data. Machine Learning, Vol. 9, pp 309–347. Kluwer Academic Publishers.

    MATH  Google Scholar 

  13. Domingos, P. & Pazzani, M. (1996). Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier. Proc. 13th International Conference on Machine Learning.

    Google Scholar 

  14. Domingos, P. & Pazzani, M. (1997). On the Optimality of the Simple Bayesian Classifier under Zero-One Loss. Machine Learning, Vol. 29. Kluwer Academic Publishers.

    Google Scholar 

  15. Dougherty, J., Kohavi, R. and Sahami, M. (1995). Supervised and Unsupervised Discretization of Continuous Features. Proc. 12th International Conference on Machine Learning.

    Google Scholar 

  16. Friedman, N., Geiger, D. and Goldszmidt, M. (1997). Bayesian Network Classifiers. Machine Learning, Vol. 29, pp 131–163. Kluwer Academic Publishers, Boston.

    Google Scholar 

  17. Garg, A. and Roth, D. (2001) Understanding Probabilistic Classifiers. Proc.12th European Conference on Machine Learning.

    Google Scholar 

  18. Grossman, D. and Domingos, P. (2004). Learning Bayesian Network Classifiers by Maximizing Conditional Likelihood. Proc. 21st International Conference on Machine Learning.

    Google Scholar 

  19. Heckerman, D., Geiger, D. and Chickering, D.M. (1995). Learning Bayesian Networks: The Combination of Knowledge and Statistical Data. Machine Learning, Vol. 20, pp 197–243.

    MATH  Google Scholar 

  20. Keogh, E. and Pazzani, M.J. (2002). Learning the Structure of Augmented Bayesian Classifiers. Internationa/Journal on Artificial Intelligence Tools. Vol. 11, No. 4, pp 587–601.

    Article  Google Scholar 

  21. Kohavi, R., Sommerfield, D. and Dougherty, J. (1997). Data Mining using MLC++. International Journal on Artificial Intelligence Tools. Vol. 6, No. 4, pp 537–566.

    Article  Google Scholar 

  22. Ling, C.X. and Zhang, H. (2002). The Representational Power of Discrete Bayesian Networks. Journal of Machine Learning Research, Vol. 3.

    Google Scholar 

  23. Madden, M.G. (2003). ThePerformance of Bayesian Network Classifiers Constructed using Different Techniques. Proc. European Conference on Machine Learning, Workshopon Probabilistic Graphical Models for Classification.

    Google Scholar 

  24. Nadeau, C. and Bengio, Y. (2000). Inference for the generalization error. Advances in Neural Information Processing Systems 12, MIT Press.

    Google Scholar 

  25. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco.

    Google Scholar 

  26. Silander, T. and Myllymäki, P. (2006). A Simple Approach for Finding the Globally Optimal Bayesian Network Structure. Proc. 22nd Conference on Uncertainty in Artificial Intelligence.

    Google Scholar 

  27. Zhang, H. and Ling, C.X. (2001) An improved learning algorithm for augmented Naive Bayes. Proc. Fifth Pacific-Asia Conferenceon Knowledge Discovery in Databases.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag London Limited

About this paper

Cite this paper

Madden, M.G. (2009). On the Classification Performance of TAN and General Bayesian Networks. In: Bramer, M., Petridis, M., Coenen, F. (eds) Research and Development in Intelligent Systems XXV. SGAI 2008. Springer, London. https://doi.org/10.1007/978-1-84882-171-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-171-2_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-170-5

  • Online ISBN: 978-1-84882-171-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics