Performance Comparison of Naïve Bayes and J 48 Classification Algorithms

Classification is an important data mining technique with broad applications. It classifies data of various kinds. Classification is used in every field of our life. Classification is used to classify each item in a set of data into one of predefined set of classes or groups. This paper has been carried out to make a performance evaluation of Naïve Bayes and j48 classification algorithm. Naive Bayes algorithm is based on probability and j48 algorithm is based on decision tree. The paper sets out to make comparative evaluation of classifiers NAÏVE BAYES AND J48 in the context of financial institute dataset to maximize true positive rate and minimize false positive rate of defaulters rather than achieving only higher classification accuracy using WEKA tool. The experiments results shown in this paper are about classification accuracy and cost analysis. The results in the paper on this dataset also show that the efficiency and accuracy of j48 and Naive bayes is good.

[1]  Jiawei Han,et al.  Generalization and decision tree induction: efficient classification in data mining , 1997, Proceedings Seventh International Workshop on Research Issues in Data Engineering. High Performance Database Management for Large-Scale Applications.

[2]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[3]  Usama M. Fayyad,et al.  Branching on Attribute Values in Decision Tree Generation , 1994, AAAI.

[4]  Harry Zhang,et al.  Naive Bayesian Classifiers for Ranking , 2004, ECML.

[5]  C. Apte,et al.  Data mining with decision trees and decision rules , 1997, Future Gener. Comput. Syst..

[6]  Anders L. Madsen,et al.  Probabilistic Networks - An Introduction to Bayesian Networks and Influence Diagrams , 2005 .

[7]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..