Real-valued negative selection algorithm with variable-sized detectors
Abstract
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 real-world datasets, including time series data that are transformed into multiple-dimensional data during the preprocessing phase. Preliminary results demonstrate that the new approach enhances the negative selection algorithm in efficiency and reliability without significant increase in complexity. © Springer-Verlag Berlin Heidelberg 2004.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Recommended Citation
Ji, Z., & Dasgupta, D. (2004). Real-valued negative selection algorithm with variable-sized detectors. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3102, 287-298. https://doi.org/10.1007/978-3-540-24854-5_30
