International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 84 - Number 14 |
Year of Publication: 2013 |
Authors: Akhilesh Kumar Shrivas, S. K. Singhai, H. S. Hota |
10.5120/14647-2967 |
Akhilesh Kumar Shrivas, S. K. Singhai, H. S. Hota . An Efficient Decision Tree Model for Classification of Attacks with Feature Selection. International Journal of Computer Applications. 84, 14 ( December 2013), 42-48. DOI=10.5120/14647-2967
Application of Internet is increasing rapidly in almost all the domains including online transaction and data communication, due to which cases of attacks are increasing rapidly. Also security of information in victim computer is an important need, which requires a security wall for identification and prevention of attacks in form of intrusion detection system (IDS). Basically Intrusion detection system (IDS) is a classifier that can classify the network data as normal or attack. Our main motive in this piece of research work is to develop a robust binary classifier as an IDS using various decision tree based techniques applied on NSL-KDD data set. Due to high dimensionality of data set, ranking based feature selection technique is used to select critical features and to reduce unimportant features to be applied to deduct random forest model, which is obtained as one of the best model. Empirical result shows that random forest model produces highest accuracy of 99. 84% (Almost 100%) with only 19 features. Performance of the model with reduced feature subsets are also evaluated using other performance measures like true positive rate (TPR), false positive rate (FPR), precision, F-measure and receiver operating characteristic (ROC) area and the results are found to be satisfactory.