{'fraction_non_alphanumeric': 0.023008849557522124, 'fraction_numerical': 0.0, 'mean_word_length': 5.426136363636363, '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}}
Sequential Maximum Gradient Optimization for Support Vector detection

Support Vector Machines (SVM) are playing an increasing role for detection problems in various engineering domains, notably in statistical signal processing, pattern recognition, image analysis, and communication systems. In this paper, we present a new method for optimizing Support Vector Machines for classification problems. An implicit reformulation of the optimization problem is proposed. The bias term is added to the primal problem formulation, which leads to eliminating the equality constraint. In order to deal with large data set problems, we propose a decomposition method, Sequential Maximum Gradient Optimization (SMGO), that relies on the selection of the working set via the search of the highest absolute values of the gradient. Furthermore, considering the quadratic nature of the dual problem, the optimum step-size is analytically determined. Moreover the solution, the gradient and the objective function are recursively calculated. The Gram matrix has not to be stored. SMGO is easy to implement and able to perform on large data sets.