{'fraction_non_alphanumeric': 0.018776077885952713, 'fraction_numerical': 0.0, 'mean_word_length': 5.283842794759825, '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}}
Fuzzy Style K-Plane Clustering

As the first attempt, this article considers how to provide a design methodology for style clustering on stylistic data, where each cluster depends on both the similarities between data samples and its latently or apparently distinguishable style. By taking our previous fuzzy k plane clustering algorithm as the basic framework, a fuzzy style k-plane clustering (S-KPC) algorithm is proposed to have its distinctive merits: First, the nuances between styles of clusters can be well identified by using the proposed twofold data representation. That is to say, style matrices are used to express the structure, hence style information of each cluster, whereas the augmentation of the original features of data with enhanced nodes is taken as an abstract representation so as to move the manifold structure of data apart. Such a twofold data representation can make us realize S-KPC readily in an incremental way. Second, by means of alternating optimization strategy, the objective function of S-KPC can be optimized such that each discriminant function of each cluster shares the advantages of both simple regression models and functional-link neural networks. Extensive experiments on synthetic and real-world datasets demonstrate that S-KPC has comparable clustering performance with several compared methods on the adopted ordinary datasets, and yet it obviously outperforms them on stylistic datasets.