{'fraction_non_alphanumeric': 0.021151586368977675, 'fraction_numerical': 0.0, 'mean_word_length': 5.604651162790698, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A self-adaptive negative selection approach for anomaly detection

To date, negative selection algorithms that possess evolutionary features, for example, the NSMutation algorithm, require the optimal value of their strategy parameters, e.g., the mutation rate and the detector lifetime indicator, to be tuned manually. The labor required for this is too time consuming and impractical when manual trial and error is used to determine the values of the strategy parameters. A reasonable alternative is to let the evolutionary algorithm determine the settings itself by using self-adaptive techniques. This work presents an evolutionary negative selection algorithm for anomaly detection (nonstationary environments) that outperforms the NSMutation on benchmark tests by using self-adaptive techniques to mutate the mutation step size of the detectors.