An improved V-detector algorithm of identifying boundary self

The V-detector algorithm is a real-valued negative selection algorithm with variable-sized detectors. In this paper, several flaws existed in the algorithm are investigated and analyzed. An improved V-detector algorithm is also proposed and implemented. The improved algorithm divides the collection of self samples into boundary selves and non-boundary selves. The identifying and recording mechanism of boundary self are introduced during the generation of detectors. The experiment results showed that the new algorithm covers the holes existed in boundary between self region and non-self region more effectively than traditional negative selection algorithm does. In the meantime, the new algorithm can reduce the number of detectors under the circumstance of ensuring detection performance.