A Benchmark Study on Time Series Clustering
This paper presents the first time series clustering benchmark utilizing all time series datasets currently available in the University of California Riverside (UCR) archive -- the state of the art repository of time series data. Specifically, the benchmark examines eight popular clustering methods representing three categories of clustering algorithms (partitional, hierarchical and density-based) and three types of distance measures (Euclidean, dynamic time warping, and shape-based). We lay out six restrictions with special attention to making the benchmark as unbiased as possible. A phased evaluation approach was then designed for summarizing dataset-level assessment metrics and discussing the results. The benchmark study presented can be a useful reference for the research community on its own; and the dataset-level assessment metrics reported may be used for designing evaluation frameworks to answer different research questions.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDynamic Time WarpingTime SeriesTime Series AnalysisTime Series ClusteringSimilar Papers 제목 키워드 기반
CSTS: A Benchmark for the Discovery of Correlation Structures in Time Series Clustering
Time series clustering promises to uncover hidden structural patterns in data with applications across healthcare, finance, industrial systems, and other critical domains. However, without validated ground truth informat…
ClusteringClustering Algorithms EvaluationClustering Multivariate Time SeriesTime Series+1Time series clustering based on prediction accuracy of global forecasting models
In this paper, a novel method to perform model-based clustering of time series is proposed. The procedure relies on two iterative steps: (i) K global forecasting models are fitted via pooling by considering the series pe…
ClusteringTime SeriesTime Series ClusteringA Review and Evaluation of Elastic Distance Functions for Time Series Clustering
Time series clustering is the act of grouping time series data without recourse to a label. Algorithms that cluster time series can be classified into two groups: those that employ a time series specific distance measure…
ClusteringDynamic Time WarpingTime SeriesTime Series Analysis+1A self-organising eigenspace map for time series clustering
This paper presents a novel time series clustering method, the self-organising eigenspace map (SOEM), based on a generalisation of the well-known self-organising feature map (SOFM). The SOEM operates on the eigenspaces o…
ClusteringTime SeriesTime Series AnalysisTime Series Clustering+2SOMTimeS: Self Organizing Maps for Time Series Clustering and its Application to Serious Illness Conversations
There is an increasing demand for scalable algorithms capable of clustering and analyzing large time series datasets. The Kohonen self-organizing map (SOM) is a type of unsupervised artificial neural network for visualiz…
ClusteringDynamic Time WarpingTime SeriesTime Series Analysis+1