Evolutionary Method o f Detecting Intrusions u sing Different Population Dynamics

Abstract

Chaos theory plays a vital role in any evolutionary based algorithms for avoiding the local optima and to improve the convergence speed. Various researchers have used different methods to increase the detection rate and to speed up the convergence. Some researchers have used evolutionary algorithms for the same purpose and has proved that the application of those algorithms provide good results. Most of the researchers have used population sizes which remains constant throughout the evolution. It has been seen that small population size may result in premature convergence and large population size requires more computation time to find a solution. In this paper, a novel application of different population dynamics to the genetic programming (GP) algorithm has been applied to manage the population size. The main focus was to improve the accuracy of the normal GP algorithm by varying the population sizes at each generation. The experiments were conducted on the standard GP algorithm using static and dynamic population sizes. Different population dynamics has been used to check the effectiveness of the proposed algorithm. The results obtained has shown that dynamic population size gives better results compared to static population size and also solves the problem of local optima.