scholarly journals A Novel Negative Selection Algorithm with Optimal Worst-case Training Time Complexity for R-chunk Detectors

2020 ◽  
Vol 13 (10) ◽  
pp. 1160-1171 ◽  
Author(s):  
Nguyen Van Truong
Keyword(s):  
Time Complexity ◽  
Negative Selection ◽  
Selection Algorithm ◽  
Worst Case ◽  
Training Time ◽  
Negative Selection Algorithm

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.

Sign in / Sign up

Export Citation Format

Share Document