{'fraction_non_alphanumeric': 0.010951979780960405, 'fraction_numerical': 0.0016849199663016006, 'mean_word_length': 5.491803278688525, '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}}
Kernel-Based k-Representatives Algorithm for Fuzzy Clustering of Categorical Data

Fuzzy cluster analysis plays an essential role in addressing unclear boundaries between clusters in data and aims to group objects into fuzzy clusters based on their similarities. In this paper, we propose a new method for fuzzy clustering of data with categorical attributes. Specifically, we first introduce a method for kernel-based representation of cluster centers in which the underlying distribution of categorical values within a cluster center is estimated as a weighted sum of the uniform distribution and their frequency distribution. We then extend the k-centers clustering method by applying this newly proposed method of cluster center presentation for fuzzy clustering of categorical data. The effectiveness and efficiency of the proposed method are demonstrated by conducting experiments on 16 realworld datasets and comparing the results with those of existing methods. In addition, our research can be regarded as the first attempt to apply a fuzzy silhouette scoring method that includes internal coherence and external separation of fuzzy clusters into clustering of categorical data.