scholarly journals A real negative selection algorithm with evolutionary preference for anomaly detection

Open Physics ◽  
2017 ◽  
Vol 15 (1) ◽  
pp. 121-134 ◽  
Author(s):  
Tao Yang ◽  
Wen Chen ◽  
Tao Li
Keyword(s):  
Negative Selection ◽  
Feature Space ◽  
Dimensional Subspace ◽  
Experimental Result ◽  
High Dimensional ◽  
Selection Algorithm ◽  
Negative Selection Algorithm ◽  
Preference Theory ◽  
Low Dimensional ◽  
Selection Algorithms

AbstractTraditional real negative selection algorithms (RNSAs) adopt the estimated coverage (c0) as the algorithm termination threshold, and generate detectors randomly. With increasing dimensions, the data samples could reside in the low-dimensional subspace, so that the traditional detectors cannot effectively distinguish these samples. Furthermore, in high-dimensional feature space,c0cannot exactly reflect the detectors set coverage rate for the nonself space, and it could lead the algorithm to be terminated unexpectedly when the number of detectors is insufficient. These shortcomings make the traditional RNSAs to perform poorly in high-dimensional feature space. Based upon “evolutionary preference” theory in immunology, this paper presents a real negative selection algorithm with evolutionary preference (RNSAP). RNSAP utilizes the “unknown nonself space”, “low-dimensional target subspace” and “known nonself feature” as the evolutionary preference to guide the generation of detectors, thus ensuring the detectors can cover the nonself space more effectively. Besides, RNSAP uses redundancy to replacec0as the termination threshold, in this way RNSAP can generate adequate detectors under a proper convergence rate. The theoretical analysis and experimental result demonstrate that, compared to the classical RNSA (V-detector), RNSAP can achieve a higher detection rate, but with less detectors and computing cost.

A Negative Selection Algorithm Base on the Self R-Tree

2013 ◽  
Vol 411-414 ◽  
pp. 2007-2012
Author(s):  
Kun Peng Wang
Keyword(s):  
Time Complexity ◽  
Negative Selection ◽  
Selection Process ◽  
The Self ◽  
Selection Algorithm ◽  
Negative Selection Algorithm ◽  
Data Query ◽  
Query Process ◽  
Algorithm Base ◽  
Selection Algorithms

In this article, we present a new negative selection algorithm which the self-data is organized as a R-Tree structure. And the negative selection process could be transformed into the data query process in the self-R-Tree, if a new detector is indexed in any leaf node it will be dropped. As the time complexity of data query process in the tree is in the log level, the negative selection process of our algorithm is superior to the linearly comparation procedure in the traditional negative selection algorithms.

scholarly journals A Real-Valued Negative Selection Algorithm Based on Grid for Anomaly Detection

2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
Ruirui Zhang ◽  
Tao Li ◽  
Xin Xiao
Keyword(s):  
Negative Selection ◽  
Artificial Immune Systems ◽  
Real Space ◽  
Time Cost ◽  
Selection Algorithm ◽  
Theory Analysis ◽  
Negative Selection Algorithm ◽  
Matching Process ◽  
Self Tolerance ◽  
Selection Algorithms

Negative selection algorithm is one of the main algorithms of artificial immune systems. However, candidate detectors randomly generated by traditional negative selection algorithms need to conduct self-tolerance with all selves in the training set in order to eliminate the immunological reaction. The matching process is the main time cost, which results in low generation efficiencies of detectors and application limitations of immune algorithms. A novel algorithm is proposed, named GB-RNSA. The algorithm analyzes distributions of the self set in real space and regards then-dimensional [0, 1] space as the biggest grid. Then the biggest grid is divided into a finite number of sub grids, and selves are filled in the corresponding subgrids at the meantime. The randomly generated candidate detector only needs to match selves who are in the grid where the detector is and in its neighbor grids, instead of all selves, which reduces the time cost of distance calculations. And before adding the candidate detector into mature detector set, certain methods are adopted to reduce duplication coverage between detectors, which achieves fewer detectors covering the nonself space as much as possible. Theory analysis and experimental results demonstrate that GB-RNSA lowers the number of detectors, time complexity, and false alarm rate.

scholarly journals A Clone Selection Based Real-Valued Negative Selection Algorithm

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-20
Author(s):  
Ruirui Zhang ◽  
Xin Xiao
Keyword(s):  
Negative Selection ◽  
Immune Cell ◽  
Clonal Selection ◽  
Space Distribution ◽  
Small Radius ◽  
Clonal Selection Algorithm ◽  
Selection Algorithm ◽  
Immune Cell Population ◽  
Negative Selection Algorithm ◽  
Selection Algorithms

Excessive detectors, high time complexity, and loopholes are main problems which current negative selection algorithms have face and greatly limit the practical applications of negative selection algorithms. This paper proposes a real-valued negative selection algorithm based on clonal selection. Firstly, the algorithm analyzes the space distribution of the self set and gets the set of outlier selves and several classification clusters. Then, the algorithm considers centers of clusters as antigens, randomly generates initial immune cell population in the qualified range, and executes the clonal selection algorithm. Afterwards, the algorithm changes the limited range to continue the iteration until the non-self space coverage rate meets expectations. After the algorithm terminates, mature detector set and boundary self set are obtained. The main contributions lie in (1) introducing the clonal selection algorithm and randomly generating candidate detectors within the stratified limited ranges based on clustering centers of self set; generating big-radius candidate detectors first and making them cover space far from selves, which reduces the number of detectors; then generating small-radius candidate detectors and making them gradually cover boundary space between selves and non-selves, which reduces the number of holes; (2) distinguishing selves and dividing them into outlier selves, boundary selves, and internal selves, which can adapt to the interference of noise data from selves; (3) for anomaly detection, using mature detector set and boundary self set to test at the same time, which can effectively improve the detection rate and reduce the false alarm rate. Theoretical analysis and experimental results show that the algorithm has better time efficiency and detector generation quality according to classic negative selection algorithms.

Negative selection algorithm based on grid file of the feature space

2014 ◽  
Vol 56 ◽  
pp. 26-35 ◽  
Author(s):  
Chen Wen ◽  
Ding Xiaoming ◽  
Li Tao ◽  
Yang Tao
Keyword(s):  
Negative Selection ◽  
Feature Space ◽  
Selection Algorithm ◽  
Negative Selection Algorithm

Research on the Network Fault Isolation Based on Negative Selection

2014 ◽  
Vol 926-930 ◽  
pp. 2079-2083
Author(s):  
Yan Guang Li
Keyword(s):  
Objective Function ◽  
Negative Selection ◽  
Fault Isolation ◽  
Experimental Result ◽  
Selection Algorithm ◽  
Negative Selection Algorithm ◽  
Network Fault ◽  
Fault Information ◽  
Operation Cost

An algorithm for constrained flooding based on negative selection is proposed due to improve delay of flooding and quality of operation when the network transmit the fault information. According to the network environment different demand between delay of flooding and quality of operation, cost function of flooding delay and operation losing are set, the optimizing objective function synthesize two factor is also set, and negative selection algorithm is used to compute the area of constrained flooding. The experimental result shows that this algorithm can improve the capability in network.

Sign in / Sign up

Export Citation Format

Share Document