A Compressed Hidden Naive Bayesian Classifier

This paper proposes a compressed hidden naive Bayesian (C-HNB) classifier which is an improved version of hidden naive Bayesian (HNB) by compressing the Bayesian network structure and calculating the attribute correlation with maximal information coefficient (MIC). In C-HNB, we remodel the Bayesian network structure based on the chain rule of joint probability distribution so that the number of hidden parent nodes in C-HNB is smaller than the number of hidden parent nodes in HNB, which reduces the training complexity of Bayesian network. In addition, the attribute correlation in C-HNB is calculated with MIC rather than the mutual information, which makes the Bayesian network more stable because the calculation of mutual information is severely influenced by the discretization of continuous attribute. On the selected KEEL benchmark data sets, we compare the classification performances of C-HNB with HNB. The comparative results show that C-HNB can obtain the better prediction accuracy with the less training time in comparison with HNB and thus the experimental results demonstrate the effectiveness of C-HNB.