{'fraction_non_alphanumeric': 0.016296296296296295, 'fraction_numerical': 0.0, 'mean_word_length': 5.558252427184466, '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}}
Evaluation of Hierarchical Structures for Time Series Data

Clustering is an effective unsupervised machine learning method that can be used as a stand-alone heuristic or as a part of a data mining process. The goal of clustering analysis is to partition data into groups with high intra-cluster association, and low inter-cluster association. Hierarchical clustering requires minimal parameters, has flexibility with similarity measure, and has strong visualization power, all of which makes it ideal for exploratory analysis. Hierarchical clustering is a particular branch of clustering algorithms where the results are not given as partitions, but rather a nested structure, which can represent the ordering among elements within a dataset. The study of the performance of hierarchical structure on time series data is limited. In this paper, we examine the hierarchical structure of time series datasets. The most popular hierarchical structured clustering heuristics include the Hierarchical Agglomerative Clustering, which is distance based; and Ordering Points To Identify the Clustering Structure, which is density based. Both share many similar characteristics and are suitable for time series data processing. We examine the performance of different hierarchical clustering algorithms with time series both internally as well as externally.