Hybrid detector set: detectors with different affinity

In an artificial immune system, how to control the number of detectors and decrease probability of fail to detect no-self is a problem. Because of existence of "holes", there are some none-self string can not be detected. Based on greedy algorithm described by D'haeseleer in [1], we present one algorithm to generate Hybrid Detector Set (detectors with different matching length), which can reduce the size of the detector set and the number of "holes". Finally, some experimental results demonstrate that this method have more efficiency and precision.

[1]  D. Dasgupta,et al.  Immunity-based systems: a survey , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[2]  Alan S. Perelson,et al.  A Change-Detection Algorithm Inspired by the Immune System , 1995 .

[3]  Stephanie Forrest,et al.  Detector coverage under the r-contiguous bits matching rule , 2002 .

[4]  Peter J. Bentley,et al.  Negative selection and niching by an artificial immune system for network intrusion detection , 1999 .

[5]  Patrik D'haeseleer,et al.  An immunological approach to change detection: theoretical results , 1996, Proceedings 9th IEEE Computer Security Foundations Workshop.

[6]  Paul Helman,et al.  An immunological approach to change detection: algorithms, analysis and implications , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[7]  Alan S. Perelson,et al.  Self-nonself discrimination in a computer , 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy.