A Novel Negative Selection Algorithm with Optimal Worst-case Training Time Complexity for R-chunk Detectors
نویسندگان
چکیده
منابع مشابه
Worst-Case Complexity of the Optimal LLL Algorithm
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter t of the algorithm has its extreme value 1. This case is of interest because the output is then the strongest Lovász–reduced basis. Experiments reported by Lagarias and Odlyzko [LO83] seem to show that the algorithm remain polynomial in average. However no bound better...
متن کاملNegative selection algorithm with constant detectors for anomaly detection
In the paper, two novel negative selection algorithms (NSAs) were proposed: FB-NSA and FFB-NSA. FBNSA has two types of detectors: constant-sized detector (CFB-NSA) and variable-sized detector (VFBNSA). The detectors of traditional NSA are generated randomly. Even for the same training samples, the position, size, and quantity of the detectors generated in each time are different. In order to el...
متن کاملWorst-Case Optimal Join at a Time
Joins are at the core of database systems, yet worst-case optimal join algorithms have been developed only recently. At the outset of this effort is the observation that the standard join plans are suboptimal as their intermediate results may be larger than the final result. To attain worst-case optimality, new join algorithms are monolithic and thus avoid intermediate results. The conceptual c...
متن کاملFully persistent arrays with optimal worst-case complexity
We describe a RAM implementation of fully persistent array with worst-case O(log logm) time complexity for update and lookup, where m is the number of modifications to the array. The space complexity of such persistent array with n elements is O(n+m). This lookup complexity is shown to be asymptotically optimal even for partially persistent arrays in the cell probe model using recent results of...
متن کاملReal-Valued Negative Selection Algorithm with Variable-Sized Detectors
A new scheme of detector generation and matching mechanism for negative selection algorithm is introduced featuring detectors with variable properties. While detectors can be variable in different ways using this concept, the paper describes an algorithm when the variable parameter is the size of the detectors in real-valued space. The algorithm is tested using synthetic and realworld datasets,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2020
ISSN: 0974-6846,0974-5645
DOI: 10.17485/ijst/2020/v13i10/149803