Binary PSO and random forests algorithm for PROBE attacks detection in a network

IEEE Congress on Evolutionary Computation(2011)

引用 21|浏览2
暂无评分
摘要
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.
更多
查看译文
关键词
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,Intrusion Detection,PROBE attacks,Particle Swarm Optimization,Random Forests
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要