A New Approach for Bayesian Classifier Learning Structure via K2 Algorithm

Abstract

Abstract. It is a well-known fact that the Bayesian Networks' (BNs) use as classifiers in different fields of application has recently witnessed a noticeable growth. Yet, the Naïve Bayes' application, and even the augmented Naïve Bayes', to classifier-structure learning, has been vulnerable to certain limits, which explains the practitioners' resort to other more sophisticated types of algorithms. Consequently, the use of such algorithms has paved the way for raising the problem of super-exponential increase in computational complexity of the Bayesian classifier learning structure, with the increasing number of descriptive variables. In this context, the present work's major objective lies in setting up a further solution whereby a remedy can be conceived for the intricate algorithmic complexity imposed during the learning of Bayesian classifiers' structure with the use of sophisticated algorithms. Noteworthy, the present paper's framework is organized as follows. We start, in the first place, by to propose a novel approach designed to reduce the algorithmic complexity without engendering any loss of information when learning the structure of a Bayesian classifier. We, then, go on to test our approach on a car diagnosis and a Lymphography diagnosis databases. Ultimately, an exposition of our conducted work's interests will be a closing step to this work.

Efficient learning of general Bayesian network Classifier by Local and Adaptive Search

“…Various Bayes classifiers have been introduced in the past decades, including Naive Bayes(NB, Figure 1(a)) [10], Tree-Augmented naive Bayes (TAN, Figure 1(b)) [11] and Hidden Naive Bayes (HNB, Figure 1(c)) [12]. They all belong to the family of Bayesian Networks (BNs, Figure 1(d)), and these simplified Bayesian network classifiers (BNCs) achieve surprisingly good performance in spite of their strong assumption.…”