Mutual information preconditioning improves structure learning of Bayesian networks from medical databases

Authors:
Antonella Meloni;Andrea Ripoli;Vincenzo Positano;Luigi Landini
Affiliations:
“Gabriele Monasterio” Foundation and the National Research Council, Institute of Clinical Physiology, Pisa, Italy and Department of Information Engineering, University of Pisa, Pisa, I ...;“Gabriele Monasterio” Foundation and the National Research Council, Institute of Clinical Physiology, Pisa, Italy;“Gabriele Monasterio” Foundation and the National Research Council, Institute of Clinical Physiology, Pisa, Italy;“Gabriele Monasterio” Foundation and the National Research Council, Institute of Clinical Physiology, Pisa, Italy and Department of Information Engineering, University of Pisa, Pisa, I ...
Venue:
IEEE Transactions on Information Technology in Biomedicine - Special section on body sensor networks
Year:
2009

Citing 16
Cited 2

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in expert systems: theory and algorithms

Probabilistic reasoning in expert systems: theory and algorithms
A Bayesian Method for the Induction of Probabilistic Networks from Data

Machine Learning
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
Structure Learning of Bayesian Networks by Genetic Algorithms: A Performance Analysis of Control Parameters

IEEE Transactions on Pattern Analysis and Machine Intelligence
Bayesian Network Classifiers

Machine Learning - Special issue on learning with probabilistic representations
Introduction to Bayesian Networks

Introduction to Bayesian Networks
Learning Bayesian networks from data: an information-theory based approach

Artificial Intelligence
Probalistic Network Construction Using the Minimum Description Length Principle

ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Improved learning of Bayesian networks

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
A Branch-and-Bound Algorithm for MDL Learning Bayesian Networks

UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Information-theoretic inference of large transcriptional regulatory networks

EURASIP Journal on Bioinformatics and Systems Biology
A hybrid anytime algorithm for the construction of causal models from sparse data

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Learning Bayesian networks from incomplete data with stochastic search algorithms

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Editorial: Bayesian networks in biomedicine and health-care

Artificial Intelligence in Medicine

Probabilistic Information Structure of Human Walking

Journal of Medical Systems
On the interplay of machine learning and background knowledge in image interpretation by Bayesian networks

Artificial Intelligence in Medicine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bayesian networks (BNs) represent one of the most successful tools for medical diagnosis, selection of the optimal treatment, and prediction of the treatment outcome. In this paper, we present an algorithm for BN structure learning, which is a variation of the standard search-and-score approach. The proposed algorithm overcomes the creation of redundant network structures that may include nonsignificant connections between variables. In particular, the algorithm finds what relationships between the variables must be prevented, by exploiting the binarization of a square matrix containing the mutual information (MI) among all pairs of variables. Two different binarization methods are implemented. The first one is based on the maximum relevance minimum redundancy selection strategy. The second one uses a threshold. The MI binary matrix is exploited as a preconditioning step for the subsequent greedy search procedure that optimizes the network score, reducing the number of possible search paths in the greedy search. Our algorithm has been tested on two different medical datasets and compared against the standard search-and-score algorithm as implemented in the DEAL package.