Deriving a concise description of non-self patterns in an aritificial immune system
New learning paradigms in soft computing
Artificial Immune Systems: A New Computational Intelligence Paradigm
Artificial Immune Systems: A New Computational Intelligence Paradigm
Generating Optimal Repertoire of Antibody Strings in an Artificial Immune System
Proceedings of the IIS'2000 Symposium on Intelligent Information Systems
Immunocomputing: Principles and Applications
Immunocomputing: Principles and Applications
Self-Nonself Discrimination in a Computer
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
An immunological approach to change detection: algorithms, analysis and implications
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
ICARIS'06 Proceedings of the 5th international conference on Artificial Immune Systems
A novel fast negative selection algorithm enhanced by state graphs
ICARIS'07 Proceedings of the 6th international conference on Artificial immune systems
Review Article: Recent Advances in Artificial Immune Systems: Models and Applications
Applied Soft Computing
Hi-index | 0.00 |
A novel negative selection algorithm, namely r[]-NSA, is proposed in this paper, which uses an array to store multiple partial matching lengths for each detector. Every bit of one detector is assigned a partial matching length. As for a detector, the partial matching length of one bit means that one string is asserted to be matched by the detector, if and only if the number of the maximal continuous identical bits between them from the position of the bit to the end of strings is no less than the partial matching length, and the continuous identical bits should start from the position of the bit. The detector generation algorithm and detection algorithm of r[]-NSA are given. Experimental results showed that r[]-NSA has better detector generation efficiency and detection performance than traditional negative selection algorithm.