DocumentCode :
2216990
Title :
Binary PSO and random forests algorithm for PROBE attacks detection in a network
Author :
Malik, Arif Jamal ; Shahzad, Waseem ; Khan, Farrukh Aslam
Author_Institution :
Nat. Univ. of Comput. & Emerging Sci., Islamabad, Pakistan
fYear :
2011
fDate :
5-8 June 2011
Firstpage :
662
Lastpage :
668
Abstract :
During the past few years, huge amount of network attacks have increased the requirement of efficient network intrusion detection techniques. Different classification techniques for identifying various attacks have been proposed in the literature. In this paper we propose and implement a hybrid classifier based on binary particle swarm optimization (BPSO) and random forests (RF) algorithm for the classification of PROBE attacks in a network. PSO is an optimization method which has a strong global search capability and is used for fine-tuning of the features whereas RF, a highly accurate classifier, is used here for classification. We demonstrate the performance of our technique using KDD99Cup dataset. We also compare the performance of our proposed classifier with eight other well-known classifiers and the results show that the performance achieved by the proposed classifier is much better than the other approaches.
Keywords :
computer network security; particle swarm optimisation; PROBE attacks detection; binary PSO; binary particle swarm optimization; classification technique; global search capability; hybrid classifier; network attacks; network intrusion detection; random forest algorithm; Classification algorithms; Feature extraction; Intrusion detection; Particle swarm optimization; Probes; Radio frequency; Vegetation; Intrusion Detection; PROBE attacks; Particle Swarm Optimization; Random Forests;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation (CEC), 2011 IEEE Congress on
Conference_Location :
New Orleans, LA
ISSN :
Pending
Print_ISBN :
978-1-4244-7834-7
Type :
conf
DOI :
10.1109/CEC.2011.5949682
Filename :
5949682
Link To Document :
بازگشت