Comparative Analysis of Classification Algorithms on KDD'99 Data Set

  • Singh Arora I
  • Kaur Bhatia G
  • et al.
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Due to the enormous growth of network based services and the need for secure communications over the network there is an increasing emphasis on improving intrusion detection systems so as to detect the growing network attacks. A lot of data mining techniques have been proposed to detect intrusions in the network. In this paper study of two different classification algorithms has been carried out: Naï ve Bayes and J48. Results obtained after applying these algorithms on 10% of the KDD " 99 dataset and on 10% of the filtered KDD " 99 dataset are compared and analyzed based on several performance metrics. Comparison between these two algorithms is also done on the basis of the percentage of correctly classified instances of different attack categories present in both the datasets as well as the time they take to build their classification models.Overall J48 is a better classifier compared to Naï ve Bayes on both the datasets but it is slow in building the classification model.

Cite

CITATION STYLE

APA

Singh Arora, I., Kaur Bhatia, G., & Pal Singh, A. (2016). Comparative Analysis of Classification Algorithms on KDD’99 Data Set. International Journal of Computer Network and Information Security, 8(9), 34–40. https://doi.org/10.5815/ijcnis.2016.09.05

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free