Naive Bayes Tree Research Articles

Integrated visual vocabulary in latent Dirichlet allocation–based scene classification for IKONOS image

Scene classification based on latent Dirichlet allocation (LDA) is a more general modeling method known as a bag of visual words, in which the construction of a visual vocabulary is a crucial quantization process to ensure success of the classification. A framework is developed using the following new aspects: Gaussian mixture clustering for the quantization process, the use of an integrated visual vocabulary (IVV), which is built as the union of all centroids obtained from the separate quantization process of each class, and the usage of some features, including edge orientation histogram, CIELab color moments, and gray-level co-occurrence matrix (GLCM). The experiments are conducted on IKONOS images with six semantic classes (tree, grassland, residential, commercial/industrial, road, and water). The results show that the use of an IVV increases the overall accuracy (OA) by 11 to 12% and 6% when it is implemented on the selected and all features, respectively. The selected features of CIELab color moments and GLCM provide a better OA than the implementation over CIELab color moment or GLCM as individuals. The latter increases the OA by only ∼2 to 3%. Moreover, the results show that the OA of LDA outperforms the OA of C4.5 and naive Bayes tree by ∼20%. © 2014 Society of Photo-Optical Instrumentation Engineers (SPIE) [DOI: 10.1117/1.JRS.8.083690]

USING FEATURE SELECTION AS ACCURACY BENCHMARKING IN CLINICAL DATA MINING

Automated prediction of new patients’ disease diagnosis based on data mining analysis on historical data is proven to be an extremely useful tool in the medical innovation. There are several studies focusing on this particular aspect. The objective of this study is two-fold. First, we look into three different classifiers, which are the Naive Bayes, Multilayer Perceptron (MLP) and Decision Tree J48 to predict the diagnosis results. Next, we investigate the effects of feature selection in such experiments. We also compare the experimental results with the study of Comparative Disease Profile (CDP) using the same dataset. Results have shown that the Naive Bayes provides the best result in terms of accuracy in our experiments and in comparison with CDP. However, we suggest using Multilayer Perceptron since the variables used in our experiments are inter-dependent among each other. In addition, MLP has shown better accuracy than CDP.

An Implementation of Efficient Datamining Classification Algorithm using Nbtree

Knowledge [no more Information] is not only power, but also has significant competitive advantage. Data warehousing is not a new idea. The use of corporate data for strategic decision making, as opposed to the use of data for tracking and enabling operations, has gone on for a computing itself. As the business these days contain huge amounts of data and the users connected to these databases across the globe and round the clock have the necessity for maintaining a separate database for the sake of analysis. This paper proposes one method of feature selection of NB Tree Algorithm. The Proposed algorithm (NB Tree) gives an effective Classification Algorithm for reducing computational time and gives better accuracy results compare with another algorithms. In many applications, however, an accurate ranking of instances based on the class probability is more desirable. The dependence between two attributes is determined based on the probabilities of their joint values that contribute to true and false classification decisions. The paper also evaluates the approach by comparing it with existing feature selection algorithms over 8 datasets from University of California, Irvine (UCI) machine learning databases. The proposed method shows better results in terms of number of selected features, classification accuracy, and running time than most existing algorithms.

Spam Mail Filtering Technique using Different Decision Tree Classifiers through Data Mining Approach - A Comparative Performance Analysis

recent years the highestdegree of communication happens through e-mails which are often affected by passive or active attacks. Effective spam filtering measures are the timely requirement to handle such attacks. Many efficient spam filters are available now-a-days with different degrees of performance and usually the accuracy level varies between 60-80% on an average. But most of the filtering techniques are unable to handle frequent changing scenario of spam mails adopted by the spammers over the time. Therefore improved spam control algorithms or enhancing the efficiency of various existing data mining algorithms to its fullest extent are the utmost requirement.In this paper three types of decision tree classifying techniques which are basically data mining classifiers namely Naive Bayes Tree classifier (NBT), C 4.5 (or J48) decision tree classifier and Logistic Model Tree classifier (LMT) are studied and analyzed for spam mail filtration. The test results depict that LMT is giving the most efficient result in terms of performance with almost 90% accuracy level to detect spam mails and non-spam (HAM) mails.

Analytical CRM in banking and finance using SVM: a modified active learning-based rule extraction approach

This paper presents advancement to modified active learning-based approach in an eclectic framework for extracting if-then rules from support vector machine (SVM) for customer relationship management (CRM) purposes. The proposed approach comprises of three major phases: 1feature selection using SVM-RFE (recursive feature elimination) 2active learning for synthetic data generation 3rule generation using decision tree (DT) and Naive Bayes tree (NBTree). Finance problems solved in this study are churn prediction in bank credit cards customers and fraud detection in insurance. Based on sensitivity measure, the empirical results suggest that the proposed modified active learning-based rule extraction approach yielded best sensitivity and, length and number of rules is reduced resulting in improved comprehensibility. Feature selection leads to the most important attributes of the customers and extracted rules serves as early warning system to the management to enforce better CRM practices and detect/avoid possi...

A Novel Multi-Classifier Layered Approach to Improve Minority Attack Detection in IDS

Due to the tremendous growth of network based services, intrusion detection has emerged as an important technique for network security. While variety of security techniques are being developed and a lot of research is going on intrusion detection, but the field lacks an integrated approach with high detection rate (recall) and precision for minority attacks namely R2L and U2R. However, the recall and precision goals are often conflicting and attacking them simultaneously may not work well, especially when some of the classes are rare. This paper presents a novel layered approach with multi-classifier by combining naïve bayes classifier (NBC) and naive bayes tree (NBTree) to improve detection rate and precision of minority class without hurting the performance of majority class. We identify important reduced feature set for each attack separately, to form layered approach. The proposed approach scales up the recall and precision for major as well as minor attacks, and keeps the false positives at acceptable level in intrusion detection.

Majority Voting: Material Classification by Tactile Sensing Using Surface Texture

In this paper, we present an application of machine learning to distinguish between different materials based on their surface texture. Such a system can be used for the estimation of surface friction during manipulation tasks; quality assurance in the textile, cosmetics, and harvesting industries; and other applications requiring tactile sensing. Several machine learning algorithms, such as naive Bayes, decision trees, and naive Bayes trees, have been trained to distinguish textures sensed by a biologically inspired artificial finger. The finger has randomly distributed strain gauges and polyvinylidene fluoride (PVDF) films embedded in silicone. Different textures induce different intensities of vibrations in the silicone. Consequently, textures can be distinguished by the presence of different frequencies in the signal. The data from the finger are preprocessed, and the Fourier coefficients of the sensor outputs are used to train classifiers. We show that the classifiers generalize well for unseen datasets with performance exceeding previously reported algorithms. Our classifiers can distinguish between different materials, such as carpet, flooring vinyls, tiles, sponge, wood, and polyvinyl-chloride (PVC) woven mesh with an accuracy of on unseen test data.

A Novel Bayes Model: Hidden Naive Bayes

Because learning an optimal Bayesian network classifier is an NP-hard problem, learning-improved naive Bayes has attracted much attention from researchers. In this paper, we summarize the existing improved algorithms and propose a novel Bayes model: hidden naive Bayes (HNB). In HNB, a hidden parent is created for each attribute which combines the influences from all other attributes. We experimentally test HNB in terms of classification accuracy, using the 36 UCI data sets selected by Weka, and compare it to naive Bayes (NB), selective Bayesian classifiers (SBC), naive Bayes tree (NBTree), tree-augmented naive Bayes (TAN), and averaged one-dependence estimators (AODE). The experimental results show that HNB significantly outperforms NB, SBC, NBTree, TAN, and AODE. In many data mining applications, an accurate class probability estimation and ranking are also desirable. We study the class probability estimation and ranking performance, measured by conditional log likelihood (CLL) and the area under the ROC curve (AUC), respectively, of naive Bayes and its improved models, such as SBC, NBTree, TAN, and AODE, and then compare HNB to them in terms of CLL and AUC. Our experiments show that HNB also significantly outperforms all of them.

Confidence intervals for probabilistic network classifiers

Probabilistic networks (Bayesian networks) are suited as statistical pattern classifiers when the feature variables are discrete. It is argued that their white-box character makes them transparent, a requirement in various applications such as, e.g., credit scoring. In addition, the exact error rate of a probabilistic network classifier can be computed without a dataset. First, the exact error rate for probabilistic network classifiers is specified. Secondly, the exact sampling distribution for the conditional probability estimates in a probabilistic network classifier is derived. Each conditional probability is distributed according to the bivariate binomial distribution. Subsequently, an approach for computing the sampling distribution and hence confidence intervals for the posterior probability in a probabilistic network classifier is derived. Our approach results in parametric bootstrap confidence intervals. Experiments with general probabilistic network classifiers, the Naive Bayes classifier and tree augmented Naive Bayes classifiers (TANs) show that our approximation performs well. Also simulations performed with the Alarm network show good results for large training sets. The amount of computation required is exponential in the number of feature variables. For medium and large-scale classification problems, our approach is well suited for quick simulations. A running example from the domain of credit scoring illustrates how to actually compute the sampling distribution of the posterior probability.