Skip to main content

Selective Augmented Bayesian Network Classifiers Based on Rough Set Theory

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3056))

Included in the following conference series:

Abstract

The naive Bayes classifier is widely used in interactive applications due to its computational efficiency, direct theoretical base, and competitive accuracy. However, its attribute independence assumption can result in sub-optimal accuracy. A number of techniques have explored simple relaxations of the attribute independence assumption in order to increase accuracy. TAN is a state-of-the-art extension of naive Bayes, that can express limited forms of inter-dependence among attributes. Rough sets theory provides tools for expressing inexact or partial dependencies within dataset. In this paper, we present a variant of TAN using rough sets theory and compare their tree classifier structures, which can be thought of as a selective restricted trees Bayesian classifier. It delivers lower error than both pre-existing TAN-based classifiers, with substantially less computation than is required by the SuperParent approach.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Domingos, P., Pazzani, M.: Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier. In: Proceedings of the Thirteenth ICML, pp. 105–112. Morgan Kaufmann Publishers, San Francisco (1996)

    Google Scholar 

  2. Fayyad, U., Irani, K.: Multi-Interval Discretization of Continuous-valued Attributes for Classification Learning. In: Proceedings of the 13th IJCAI, pp. 1022–1027. Morgan Kaufmann Publishers, Seattle (1993)

    Google Scholar 

  3. Friedman, N., Geiger, D., Goldszmidt, M.: Bayesian Network Classifiers. Machine Learning 29, 131–163 (1997)

    Article  MATH  Google Scholar 

  4. Friedman, N., Goldszmidt, M.: Building Classifiers Using Bayesian Networks. In: Proc. of the 13h National Conf. on AI, Menlo Park, pp. 1277–1284 (1996)

    Google Scholar 

  5. Keogh, E.J., Pazzani, M.J.: Learning Augmented Bayesian Classifiers: A Comparison of Distribution-Based and Classification-Based Approaches. In: Proceedings of the 7th International Workshop on AI and Statistics, pp. 225–230 (1999)

    Google Scholar 

  6. Keogh, E.J., Pazzani, M.J.: Learning the Structure Augmented Bayesian Classifiers. Int. J. on AI Tools 11, 587–601 (2002)

    Article  Google Scholar 

  7. Kohavi, R.: Scaling up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybird. In: Simoudis, E., Han, J.W., Fayyad, U.M. (eds.) Proceedings of the 2nd International Conference on KDD, pp. 202–207. The AAAI Press, Menlo Park (1996)

    Google Scholar 

  8. Kohavi, R., Becker, B., Sommerfield, D.: Improving Simple Bayes. In: Proceedings of the ECML (1997)

    Google Scholar 

  9. Langley, P., Sage, S.: Induction of Selective Bayesian Classifiers. In: Proceedings of the 10th Conf. on UAI, pp. 339–406. Morgan Kaufmann Publishers, Seattle (1994)

    Google Scholar 

  10. Minieka, E.: Optimization Algorithms for Networks and Graphs, pp. 26–36. Marcel Dekker, Inc., New York (1978)

    MATH  Google Scholar 

  11. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluweer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  12. Sahami, M.: Learning Limited Dependence Bayesian Classifiers. In: Proceedings of the 2nd Int. Conf.on KDD, pp. 335–338. AAAI Press, Portland (1996)

    Google Scholar 

  13. Slezak, D.: Searching for Frequential Reduts in Decision Tables with Uncertain Objects. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 52–59. Springer, Heidelberg (1998)

    Google Scholar 

  14. Wang, Z., Webb, G.I.: Comparison of Lazy Bayesian Rule and Tree-Augmented Bayesian Learning. In: Proc. of ICDM 2002, pp. 490–497. IEEE Computer Society, Los Alamitos (2002)

    Chapter  Google Scholar 

  15. Webb, G.I., Boughton, J., Wang, Z.: Averaged One-Dependence Estimators: Preliminary Results. In: Proc. of ADM 2002, pp. 65–73. UTS, Canberra (2002)

    Google Scholar 

  16. Webb, G.I., Pazzani, M.J.: Adjusted Probability Naive Bayesian Induction. In: Proceedings of the 11th AJCAI, pp. 285–295. Springer, Brisbane (1998)

    Google Scholar 

  17. Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, Seattle (2000)

    Google Scholar 

  18. Zheng, Z., Webb, G.I.: Lazy Learning of Bayesian Rules. Machine Learning 41, 53–84 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Z., Webb, G.I., Zheng, F. (2004). Selective Augmented Bayesian Network Classifiers Based on Rough Set Theory. In: Dai, H., Srikant, R., Zhang, C. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2004. Lecture Notes in Computer Science(), vol 3056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24775-3_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24775-3_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22064-0

  • Online ISBN: 978-3-540-24775-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics