{'fraction_non_alphanumeric': 0.022511848341232227, 'fraction_numerical': 0.0, 'mean_word_length': 5.926229508196721, '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}}
RegK-Means: A Clustering Algorithm Using Spatial Contiguity Constraints for Regionalization Problems

Regionalization embraces many problems in which the recognition and analysis of patterns in geographic regions is necessary. Clustering techniques and some optimization methods offer algorithms and tools to facilitate this task, and AZP (Automatic Zoning Problem) is one of these optimization methods. In this work, we use semi-supervised clustering by adapting K-Means for regionalization, which was not previously explored. For this purpose, we specified contiguity constraints based on a neighborhood representation. The proposed algorithm is called RegK-Means. Experimental results using three real datasets show improvement in intra-cluster variance, minimization of objective function and computational time improvement compared to AZP.