Saved in:
Bibliographic Details
Main Authors: Charoensuk, Chutiphan, Wiroonsri, Nathakhun
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2505.02173
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910930920538112
author Charoensuk, Chutiphan
Wiroonsri, Nathakhun
author_facet Charoensuk, Chutiphan
Wiroonsri, Nathakhun
contents Time series clustering is an unsupervised learning method for classifying time series data into groups with similar behavior. It is used in applications such as healthcare, finance, economics, energy, and climate science. Several time series clustering methods have been introduced and used for over four decades. Most of them focus on measuring either Euclidean distances or association dissimilarities between time series. In this work, we propose a new dissimilarity measure called ranked Pearson correlation dissimilarity (RDPC), which combines a weighted average of a specified fraction of the largest element-wise differences with the well-known Pearson correlation dissimilarity. It is incorporated into hierarchical clustering. The performance is evaluated and compared with existing clustering algorithms. The results show that the RDPC algorithm outperforms others in complicated cases involving different seasonal patterns, trends, and peaks. Finally, we demonstrate our method by clustering a random sample of customers from a Thai electricity consumption time series dataset into seven groups with unique characteristics.
format Preprint
id arxiv_https___arxiv_org_abs_2505_02173
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Ranked differences Pearson correlation dissimilarity with an application to electricity users time series clustering
Charoensuk, Chutiphan
Wiroonsri, Nathakhun
Machine Learning
Time series clustering is an unsupervised learning method for classifying time series data into groups with similar behavior. It is used in applications such as healthcare, finance, economics, energy, and climate science. Several time series clustering methods have been introduced and used for over four decades. Most of them focus on measuring either Euclidean distances or association dissimilarities between time series. In this work, we propose a new dissimilarity measure called ranked Pearson correlation dissimilarity (RDPC), which combines a weighted average of a specified fraction of the largest element-wise differences with the well-known Pearson correlation dissimilarity. It is incorporated into hierarchical clustering. The performance is evaluated and compared with existing clustering algorithms. The results show that the RDPC algorithm outperforms others in complicated cases involving different seasonal patterns, trends, and peaks. Finally, we demonstrate our method by clustering a random sample of customers from a Thai electricity consumption time series dataset into seven groups with unique characteristics.
title Ranked differences Pearson correlation dissimilarity with an application to electricity users time series clustering
topic Machine Learning
url https://arxiv.org/abs/2505.02173