A novel fast negative selection algorithm enhanced by state graphs

Authors:
Wenjian Luo;Xin Wang;Xufa Wang
Affiliations:
Nature Inspired Computation and Applications Lab., Dept. of Comp. Sci., and Techn., Univ. of Sci. and Techn. of China, Hefei, China and Anhui Key Lab. of Software in Computing and Comm., Univ. of ...;Nature Inspired Computation and Applications Laboratory, Department of Computer Science, and Technology, University of Science and Technology of China, Hefei, China;Nature Inspired Computation and Applications Lab., Dept. of Comp. Sci., and Techn., Univ. of Sci. and Techn. of China, Hefei, China and Anhui Key Lab. of Software in Computing and Comm., Univ. of ...
Venue:
ICARIS'07 Proceedings of the 6th international conference on Artificial immune systems
Year:
2007

Citing 5
Cited 2

Efficient string matching: an aid to bibliographic search

Communications of the ACM
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 Symposium on Security and Privacy
A novel negative selection algorithm with an array of partial matching lengths for each detector

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Knowledge discovery approach to automated cardiac SPECT diagnosis

Artificial Intelligence in Medicine

Review: The use of computational intelligence in intrusion detection systems: A review

Applied Soft Computing
Review Article: Recent Advances in Artificial Immune Systems: Models and Applications

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Negative Selection Algorithm is widely applied in Artificial Immune Systems, but it is not fast enough when there are mass data need to be processed. Multi-pattern matching algorithms are able to locate all occurrences of multi-patterns in an input string by just one scan operation. Inspired by the multi-pattern matching algorithm proposed by Aho and Corasick in 1975 [1], a novel fast negative selection algorithm is proposed for the "r-contiguous-bits" matching rule in this paper. The algorithm constructs a self state graph and a detector state graph according to the self set and the detector set respectively, and processes input strings using partial matching algorithm based on the state graph. The time complexity of this algorithm when processing an input string of length l is O(l). Experiments are carried out to make comparisons on the time and space costs between this new algorithm and the traditional negative selection algorithm.