{'fraction_non_alphanumeric': 0.017195767195767195, 'fraction_numerical': 0.0026455026455026454, 'mean_word_length': 5.415254237288136, '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}}
Pattern recognition using higher-order local autocorrelation coefficients

The autocorrelations have been previously used as features for 1D or 2D signal classification in a wide range of applications, like texture classification, face detection and recognition, EEG signal classification, and so on. However, in almost all the cases, the high computational costs have hampered the extension to higher orders (more than the second order). We present a method which avoids the computation of the autocorrelation coefficients and which can be applied to a large set of tools commonly used in statistical pattern recognition. We discuss different scenarios of using the autocorrelations and we show that the order of autocorrelations is no longer an obstacle.