on average time complexity of evolutionary negative selection algorithms for anomaly detection
Evolutionary Negative Selection Algorithms have been proposed and used in artificial immune system community for years. However, there are no theoretical analyses about the average time complexity of such algorithms. In this paper, the average time complexity of Evolutionary Negative Selection Algorithms for anomaly detection is studied, and the results demonstrate that its average time complexity depends on the self set very much. Some simulation experiments are done, and it is demonstrated that the theoretical results approximately agree with the experimental results. The work in this paper not only gives the average time complexity of Evolutionary Negative Selection Algorithms for the first time, but also would be helpful to understand why different immune responses (i.e. primary/cross-reactive/secondary immune response) in biological immune system have different efficiencies.
time complexity anomaly detection artificial immune system drift analysis