Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: dos Santos, Edimilson B.a; * | Hruschka Jr., Estevam R.b | do Carmo Nicoletti, M.b; c | Ebecken, Nelson F. F.d
Affiliations: [a] Federal University of S. Joao del-Rei – DCOMP/UFSJ, S. Joao del-Rei, MG, Brazil | [b] Federal University of S. Carlos – DC/UFSCar, S. Carlos, SP, Brazil | [c] FACCAMP – C. L. Paulista, SP, Brazil | [d] Federal University of Rio de Janeiro – COPPE/UFRJ, Rio de Janeiro, RJ, Brazil
Correspondence: [*] Corresponding author: Edimilson B. dos Santos, Department of Computer Science, Federal University of São João del-Rei – UFSJ, Campus Tancredo de Almeida Neves – CTAN, Av. Visconde do Rio Preto, s/n° Colônia do Bengo, CEP 36301-360, São João del-Rei – MG, Brazil. Tel.: +55 32 3373 3985; E-mail: edimilson.santos@ufsj.edu.br
Abstract: Variable Ordering (VO) plays an important role when inducing Bayesian Networks (BNs) and Bayesian Classifiers (BCs). Previous works in the literature suggest that it is worth pursuing the use of genetic/evolutionary algorithms for identifying a suitable VO, when learning a BN structure from data. This paper proposes a collaborative Evolutionary-Bayes algorithm named VOEA (Variable Ordering Evolutionary Algorithm) aimed at inducing BCs from data. The two VOEA versions presented in the paper refine a previously proposed algorithm named VOGA by employing only a single evolutionary operator (either crossover or mutation) as well as by using information about the class variable when defining the most suitable variable ordering for learning a BC. Experiments performed in a number of datasets revealed that the VOEA approach is promising and tends to generate suitable and representative BCs, particularly in its version VOEA_M, which only implements the mutation operator.
Keywords: Bayesian networks, variable ordering, evolutionary algorithms
DOI: 10.3233/HIS-140194
Journal: International Journal of Hybrid Intelligent Systems, vol. 11, no. 3, pp. 183-195, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl