{'fraction_non_alphanumeric': 0.017741935483870968, 'fraction_numerical': 0.0, 'mean_word_length': 5.21, '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}}
Relation between fractal dimension and performance of vector quantization

This paper shows that the performance of a vector quantizer is related to the intrinsic ("fractal") dimension of the data set for a perfectly self-similar object. Experiments are performed to confirm the result on synthetic and real data sets. Further to verify the result, we computed the slope and compared it to the estimate of the fractal dimension obtained using the correlation integral. However, the computation of the correlation fractal dimension is linear on the number of data points and significantly faster than vector quantization.