Title
Optimized algorithm for learning Bayesian network super-structures
Date Issued
18 June 2012
Access level
metadata only access
Resource Type
conference paper
Author(s)
Maciel C.
University of Sao Paulo
Abstract
Estimating super-structures (SS) as structural constraints for learning Bayesian networks (BN) is an important step of scaling up these models to high-dimensional problems. However, the literature has shown a lack of algorithms with an appropriate accuracy for such purpose. The recent Hybrid Parents and Children - HPC (De Morais and Aussem, 2010) has shown an interesting accuracy, but its local design and high computational cost discourage its use as SS estimator. We present here the OptHPC, an optimized version of HPC that implements several optimizations to get an efficient global method for learning SS. We demonstrate through several experiments that OptHPC estimates SS with the same accuracy than HPC in about 30% of the statistical tests used by it. Also, OptHPC showed the most favorable balance sensitivity/specificity and computational cost for use as super-structure estimator when compared to several state-of-the-art methods.
Start page
217
End page
222
Volume
1
Language
English
OCDE Knowledge area
Bioinformática
Subjects
Scopus EID
2-s2.0-84862219196
Source
Pattern Recognition Applications and Methods
ISBN of the container
9789898425980
Conference
ICPRAM 2012 - Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods
Sponsor(s)
Inst. Syst. Technol. Inf., Control Commun. (INSTICC)
Sources of information:
Directorio de Producción Científica
Scopus