中文摘要：

This paper proposes a negative selection with neighborhood representation named as neighborhood negative selection algorithm.This algorithm employs a new representation method which uses the fully adjacent but mutually disjoint neighborhoods to present the self samples and detectors.After normalizing the normal samples into neighborhood shape space,the algorithm uses a special matching rule similar as Hamming distance to train mature detectors at the training stage and detect anomaly at the detection stage.The neighborhood negative selection algorithm is tested using KDD CUP 1999 dataset.Experimental results show that the algorithm can prevent the negative effect of the dimension of shape space,and provide a more accuracy and stable detection performance.

英文摘要：

This paper proposes a negative selection with neighborhood representation named as neighborhood negative selection algorithm. This algorithm employs a new representation method which uses the fully adjacent but mutually disjoint neighborhoods to present the self samples and detectors. After normalizing the normal samples into neighborhood shape space, the algorithm uses a special matching rule similar as Hamming distance to train mature detectors at the training stage and detect anomaly at the detection stage. The neighborhood negative selection algorithm is tested using KDD CUP 1999 dataset. Experimental results show that the algorithm can prevent the negative effect of the dimension of shape space, and provide a more accuracy and stable detection performance.