Skip to main content
Article thumbnail
Location of Repository

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

By Joseph M. Shapiro


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

Topics: Categories and Subject Descriptors F.2 [Analysis of Algorithms and Problem Complexity, Miscellaneous, E.1 [DataStructures, Trees General Terms Algorithms Keywords Evolutionary computation, artificial immune systems, computational geometry, negative
Publisher: ACM Press
Year: 2005
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.