The main objective is to propose a text classification based on the features selection and preprocessing thereby reducing the dimensionality of the Feature vector and increase the classification accuracy. Text classification is the process of assigning a document to one or more target categories, based on its contents. In the proposed method, machine learning methods for text classification is ...

Introduction: This research was meant to provide a model for COPD diagnosis and to classify the cases into phenotypes; General COPD, Chronic bronchitis, Emphysema, and the Asthmatic COPD using a Bayesian Network (BN). Methods: The model was constructed through developing the Bayesian Network structure and instantiating the parameters for each of the variables. In order to validate the achiev...

In data mining, classification is a form of data analysis that can be used to extract models describing important data classes. Two of the well known algorithms used in data mining classification are Backpropagation Neural Network (BNN) and Naïve Bayesian (NB). Bayesian approaches are a fundamentally important DM technique. Given the probability distribution, Bayes classifier can provably achie...

It is well known that the naive Bayesian classiier is linear in binary domains. However, little work is done on the learnability of the naive Bayesian classiier in nominal domains, a general case of binary domains. This paper explores the geometric properties of the naive Bayesian classiier in nominal domains. First we propose a three-layer measure for the linearity of functions in nominal doma...

This work addresses the problem of having to train a Naïve Bayesian classifier using limited data. It first presents an improved instance-weighting algorithm that is accurate and robust to noise and then it shows how to combine it with a fine tuning algorithm to achieve even better classification accuracy. Our empirical work using 49 benchmark data sets shows that the improved instance-weightin...

Naive Bayesian classi ers utilise a simple mathematical model for induction. While it is known that the assumptions on which this model is based are frequently violated, the predictive accuracy obtained in discriminate classi cation tasks is surprisingly competitive in comparison to more complex induction techniques. Adjusted probability naive Bayesian induction adds a simple extension to the n...

Naive Bayesian classiiers utilise a simple mathematical model for induction. While it is known that the assumptions on which this model is based are frequently violated, the predictive accuracy obtained in discriminate classiication tasks is surprisingly competitive in comparison to more complex induction techniques. Adjusted probability naive Bayesian induction adds a simple extension to the n...

We introduce a simple empirical order-based greedy heuristic for learning discriminative Bayesian network structures. We propose two metrics for establishing the ordering of N features. They are based on the conditional mutual information. Given an ordering, we can find the discriminative classifier structure with O (Nq) score evaluations (where constant q is the maximum number of parents per n...

Naive Bayesian classiiers utilise a simple mathematical model for induction. While it is known that the assumptions on which this model is based are frequently violated, the predictive accuracy obtained in discriminate classiication tasks is surprisingly competitive in comparison to more complex induction techniques. Adjusted probability naive Bayesian induction adds a simple extension to the n...