Probabilistic Information Structure of Human Walking
Journal of Medical Systems
| Hi-index | 0.00 |
Bayesian Networks represent one of the most successful tools for medical diagnosis and therapies follow-up. We present an algorithm for Bayesian network structure learning, that is a variation of the standard search-and-score approach. The proposed approach overcomes the creation of redundant network structures that may include non significant connections between variables. In particular, the algorithm finds which 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. Four different binarization methods are implemented. 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 approach has been tested on two different medical datasets and compared against the standard search-and-score algorithm as implemented in the DEAL package.