{'fraction_non_alphanumeric': 0.026232948583420776, 'fraction_numerical': 0.0, 'mean_word_length': 5.076433121019108, '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}}
Approximate Clustering of Time-Series Datasets using k-Modes Partitioning

Data in various systems, such as those in finance, healthcare, and business, are stored as time series. As such, interest in time series mining in these areas has surged. Clustering of data is performed as a pre-processing or exploratory approach in many data mining tasks. Time series data sets are often very large, thus, data cannot fit in the main memory for clustering. In this case, dimension reduction is a common solution. However, the cost of data reduction is relatively high because of overlooking the data involved in this process, leading to low-quality clustering. In this paper, we propose a new approach for improving the approximate clustering accuracy of dimensionality reduced time series by discretization approach. A new distance measure is initially introduced. Thereafter, the partitional algorithm that best matches the representation method is proposed.