{'fraction_non_alphanumeric': 0.019756838905775075, 'fraction_numerical': 0.0, 'mean_word_length': 5.46078431372549, '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}}
A distributed K-means clustering algorithm in wireless sensor networks

It is a hard work for the traditional k-means algorithm to perform data clustering in a large, dynamic distributed wireless sensor networks. In this paper, we propose a distributed k-means clustering algorithm, in which the distributed clustering is performed at each sensor with the collaboration of its neighboring sensors. To extract the important features and improve the clustering results, the attribute-weight-entropy regularization technique is used in the proposed clustering method. Experiments on synthetic datasets have shown the good performance of the proposed algorithms.