{'fraction_non_alphanumeric': 0.021678966789667898, 'fraction_numerical': 0.0, 'mean_word_length': 5.436201780415431, '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}}
Constructing a Virtual Space for Enhancing the Classification Performance of Fuzzy Clustering

Clustering offers a general methodology and comes with a remarkably rich conceptual and algorithmic framework for data analysis and data interpretation. As one of the most representative algorithms of fuzzy clustering, fuzzy C-means (FCM) is a widely used objective function-based clustering method exploited in various applications. In this study, a virtual-based fuzzy clustering algorithm is proposed to improve the classification performance coming as a result of using fuzzy clustering. This improvement is achieved by forming a virtual space based on the original data space. First, we construct a piecewise linear transformation function to modify the similarity matrix of the original data and build the so-called virtual similarity matrix (VSM). Considering the VSM, the effect of closeness becomes amplified; in other words, high similarity values (say, larger than α which is a cutoff value of the large and small similarity in this paper) present in the original similarity matrix are made higher, whereas lower similarity levels (say, smaller than α) are further reduced. In addition, data with high similarity (say, larger than a certain threshold value) observed in the original space will overlap (the attributes of the samples are exactly the same) significantly in the virtual space; the overlapping samples can be treated as one sample. This modification makes possible easier to identify clusters. Second, we build a relationship matrix between the original dataset and the determined similarity values and present two closed-form solutions to the problem of building the relationship matrix. Subsequently, a virtual space of the original data space is derived through the modified similarity matrix and the introduced relationship matrix. We offer a thorough analysis behind the developed clustering algorithm. The experimental results are in agreement with the underlying conceptual basis. Furthermore, the resulting classification performance is significantly improved compared with the results produced by the FCM and the kernel-based fuzzy C-means.