{'fraction_non_alphanumeric': 0.014994232987312572, 'fraction_numerical': 0.0, 'mean_word_length': 5.382352941176471, '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}}
Detecting anomalies in symbolic sequence dataset

This paper presents an anomaly detection technique for symbolic sequences based on support vector data description (SVDD). It introduces the longest common subsequence (LCS) distance metric to compute pairwise similarity between sequences. We extend the kernel method to the analysis of variable-length sequences by embedding the LCS distance into the form of Gaussian function to develop a novel Gaussian LCS kernel. By using this kernel, SVDD can directly handle input sequences of variable length, and make good use of the sequential information of sequences. The performance of the proposed technique was compared with SVDD with Gaussian RBF kernel and spectrum kernel. Experimental results show that this technique is better than other techniques in achieving higher detection rate and lower false positive rate.