NUMERICAL NEGATIVE SELECTION ALGORITHM

Abstract

The artificial immune algorithm is the hot topic in much research such as the intrusion detection system, the information retrieval system and the data mining system. The negative selection algorithm is the typical artificial immune algorithm. A common representation of binary strings for antibody (detector) and antigen have been associated with inefficiencies when generating detector and inspecting antigen. We use a single integer to represent the detector and provide the basis of improving negative selection algorithm efficiency. In the detector generation algorithm, extracting sub-strings in self that its length is larger than threshold and converting them to single integer in numerical interval, then the rest integers in numerical interval are selected as numerical detectors. It can reduce the time and space overhead of detector generation and provide the facility to analyze the positive and negative errors when antigen inspection. The numerical matching rule is given. The B-tree is used to create index of numerical detector. Extracting sub-strings in antigen that its length is larger than threshold and converting them to some integers. If there is the same value as those integers in the index of numerical detector, then the antigen matches one numerical detector. It can improve the efficiency of antigen inspection. Finally the prototype of the numerical negative selection algorithm and negative selection algorithm are realized to test the overhead of the detector generation and antigen inspection using the live data set. The results show that the numerical negative selection algorithm can reduce the time and space overhead and avoid fluctuation of the overhead.