{'fraction_non_alphanumeric': 0.01424287856071964, 'fraction_numerical': 0.0, 'mean_word_length': 5.267605633802817, '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 granular principal curves algorithm for large data sets

Principal curves, as a nonlinear generalization of principal components, are a common tool used in multivariate analysis for ends like dimensionality reduction and feature extraction. However, one of the difficulties that arise when utilizing this technique is that efficiency of existing principal curves algorithms is often low when dealing with large data set owing to high computational complexity. In the paper, a new method based on the idea of “information granulation and fuzzy sets” is proposed to improve efficiency and noise robustness. First, large amounts of numerical data are granulated into C interval (granular) data based on the fuzzy C-means cluster and two criteria of granulation, which significantly reduces the amount of data that is to be processed in the later step. Then granular principal curves are constructed according to the upper and the lower bounds of the interval data. Finally we introduce a quantitative index based on the parameter α to evaluate the fuzziness of granular principal curves output, where α is a positive parameter delivering some flexibility when optimizing the information granule. A series of numeric studies completed for synthetic data set provide a useful insight into the effectiveness of the proposed algorithm.