An evolutionary algorithm to generate hyper-ellipsoid detectors for negative selection

This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-spheres are a specialization of hyper-ellipsoids, hyperellipsoids retain the benefits of hyper-spheres. However, hyper-ellipsoids are much more flexible, mostly in that they can be stretched and reoriented. The viability of using hyper-ellipsoids is established using several pedagogical problems. We conjecture that fewer hyper-ellipsoids than hyperspheres are needed to achieve similar coverage of nonself space in a negative selection problem. Experimentation validates this conjecture. In pedagogical benchmark problems, the number of hyper-ellipsoids to achieve good results is significantly ( 50%) smaller than the associated number of hyper-spheres. Categories and Subject Descriptors F.2 [Analysis of Algorithms and Problem Complexity]: Miscellaneous; E.1 [DataStructures]: Trees General Terms Algorithms Keywo...

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: Joseph M. Shapiro, Gary B. Lamont, Gilbert L. Peterson
• Keywords: Artificial Immune Systems, GECCO 2005, Negative Selection Problem, Paper Introduces Hyper-ellipsoids