{'fraction_non_alphanumeric': 0.0163265306122449, 'fraction_numerical': 0.004081632653061225, 'mean_word_length': 5.943396226415095, '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}}
CTH04-3: Source-Optimized Clustering for Distributed Source Coding

Motivated by the design of low-complexity distributed quantizers and iterative decoding algorithms that leverage the correlation in the data picked up by a large-scale sensor network, we address the problem of finding correlation preserving clusters. To construct a factor graph describing the statistical dependencies between sensor measurements, we develop a hierarchical clustering algorithm that minimizes the Kullback Leibler distance between known and approximated source statistics. Finally, we show how the clustering result can be exploited in the design of index assignments for distributed quantization and source-channel decoders of manageable complexity.