ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Data & Knowledge Engineering
Volume 63, Issue 2, November 2007, Pages 258-269
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (440 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.datak.2007.02.003    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Towards efficient variables ordering for Bayesian networks classifier

Estevam R. Hruschka Jr.a, Corresponding Author Contact Information, E-mail The Corresponding Author and Nelson F.F. Ebeckenb, E-mail The Corresponding Author

aBayesMining Lab, Computer Science Dept., Universidade Fedearl de Sao Carlos DC/UFSCar, Brazil bNTT Lab, COPPE/Universidade Federal do Rio de Janeiro, Brazil

Received 2 September 2006; 
revised 21 December 2006; 
accepted 1 February 2007. 
Available online 6 March 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Traditionally, the task of learning Bayesian Networks (BNs) from data has been treated as a NP-Hard search problem. To overcome such difficulty in terms of computational complexity, several approximations have been designed, such as imposing a previous ordering on the domain attributes that restrict the number of Bayesian structures to be learned or using other approaches trying to reduce the state space of this problem. In this paper, we propose a simple method based on feature ranking algorithms which has low computational complexity (O(n2), where n is the number of variables) and produces good results. We empirically demonstrate that feature ranking algorithms (namely, Chi-Squared and Information Gain) can be used to define efficient variables ordering in the BNC learning context. The proposed method can bring improvements, when using the K2 algorithm, to learn a Bayesian Network Classifier from data.

Keywords: Bayesian networks classifiers; Supervised learning; Variable ordering; Feature ranking

Article Outline

1. Introduction
1.1. Feature ranking
1.2. Bayesian networks
1.3. K2 algorithm
1.4. Learning classifiers from data
2. Feature ranking bayesian network classifiers learning (FRaBayCla) – K2χ2 and K2IG
3. Simulations
3.1. Class 1 datasets simulations
3.2. Class 2 datasets simulations
3.3. Other learning algorithms
4. Conclusions and future work
Acknowledgements
References
Vitae





Data & Knowledge Engineering
Volume 63, Issue 2, November 2007, Pages 258-269
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.