{'fraction_non_alphanumeric': 0.028376844494892167, 'fraction_numerical': 0.00681044267877412, 'mean_word_length': 5.082758620689655, '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 robust approach to sequence classification

We report results for classification of representations of music, spoken words, and text documents. Experimental comparisons with other state-of-the-art algorithms yield improved results for all three examples. We use a support vector machine (SVM) as our classifier in all experiments. This is driven by a kernel matrix of similarity measures between the sequences. Our similarity measure is based on n-grams of varying length (multi-grams), weighted to reflect discrimination ability. To alleviate the problem of the exponential growth of feature size with n, we use a modified LZ78 algorithm (Z. Jacob and L. Abraham, 1978) to guide feature selection. Our method exhibits good performance over the three widely distinct tasks reported here, and is very computationally efficient and may therefore be useful in real time applications