Improving algorithms for structure learning in Bayesian Networks using a new implicit score

Authors:
Lobna Bouchaala;Afif Masmoudi;Faiez Gargouri;Ahmed Rebai
Affiliations:
Bioinformatics Unit, Centre de Biotechnologie de Sfax, P.O. Box 1177, 3018 Sfax, Tunisia;Faculty of Science of Sfax, Department of Mathematics, Sfax, Tunisia;Higher Institute of Computer and Multimedia of Sfax, Sfax, Tunisia;Bioinformatics Unit, Centre de Biotechnologie de Sfax, P.O. Box 1177, 3018 Sfax, Tunisia
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 4
Cited 5

A Bayesian Method for the Induction of Probabilistic Networks from Data

Machine Learning
Improving Bayesian Network Structure Learning with Mutual Information-Based Node Ordering in the K2 Algorithm

IEEE Transactions on Knowledge and Data Engineering
Paper: Modeling by shortest data description

Automatica (Journal of IFAC)
Approximating discrete probability distributions with dependence trees

IEEE Transactions on Information Theory

Not so greedy: Randomly Selected Naive Bayes

Expert Systems with Applications: An International Journal
Using automated individual white-list to protect web digital identities

Expert Systems with Applications: An International Journal
Improved algorithm based on mutual information for learning Bayesian network structures in the space of equivalence classes

Multimedia Tools and Applications
A new learning structure heuristic of bayesian networks from data

MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
Bayesian network analysis for the dynamic prediction of early stage entrepreneurial activity index

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

Learning Bayesian Network structure from database is an NP-hard problem and still one of the most exciting challenges in machine learning. Most of the widely used heuristics search for the (locally) optimal graphs by defining a score metric and employs a search strategy to identify the network structure having the maximum score. In this work, we propose a new score (named implicit score) based on the Implicit inference framework that we proposed earlier. We then implemented this score within the K2 and MWST algorithms for network structure learning. Performance of the new score metric was evaluated on a benchmark database (ASIA Network) and a biomedical database of breast cancer in comparison with traditional score metrics BIC and BD Mutual Information. We show that implicit score yields improved performance over other scores when used with the MWST algorithm and have similar performance when implemented within K2 algorithm.