{'fraction_non_alphanumeric': 0.0111731843575419, 'fraction_numerical': 0.0, 'mean_word_length': 5.5181818181818185, '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}}
Metaheuristic techniques for Support Vector Machine model selection

The classification accuracy of a Support Vector Machine is dependent upon the specification of model parameters. The problem of finding these parameters, called the model selection problem, can be very computationally intensive, and is exacerbated by the fact that once selected, these model parameters do not carry across from one dataset to another. This paper describes implementations of both Ant Colony Optimization and Particle Swarm Optimization techniques to the SVM model selection problem. The results of these implementations on some common datasets are compared to each other and to the results of other SVM model selection techniques.