Abstract
Proliferation of temporal data in many domains has generated considerable interest in the analysis and use of time series. In that context, clustering is one of the most popular data mining methods. Whilst time series clustering algorithms generally succeed in capturing differences in shapes, they most often fail to perform clustering based on both shape and amplitude dissimilarities. In this paper, we propose a new time series clustering method that automatically determines an optimal number of clusters. Cluster refinement is based on a new dispersion criterion applied to distances between time series and their representative within a cluster. That dispersion measure allows for considering both shape and amplitude of time series. We test our method on datasets and compare results with those from K-means time series (TSK-means) and K-shape methods.
This work is supported by PIL (Province of Loyalty Islands) in New Caledonia.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chen, L., Ng, R.T.: On the marriage of LP-norms and edit distance. In: VLDB, pp. 792–803. Morgan Kaufmann (2004)
Dau, H.A., et al.: The UCR time series archive. IEEE/CAA J. Automatica Sinica 6(6), 1293–1305 (2019)
Dilmi, M.D., Barthès, L., Mallet, C., Chazottes, A.: Iterative multiscale dynamic time warping (IMs-DTW): a tool for rainfall time series comparison. Int. J. Data Sci. Anal. 10(1), 65–79 (2019). https://doi.org/10.1007/s41060-019-00193-1
Huang, X., Ye, Y., Xiong, L., Lau, R.Y., Jiang, N., Wang, S.: Time series k-means: a new k-means type smooth subspace clustering for time series data. Inf. Sci. 367–368, 1–13 (2016)
Kalpakis, K., Gada, D., Puttagunta, V.: Distance measures for effective clustering of ARIMA time-series. In: ICDM, pp. 273–280 (2001)
Keogh, E., Pazzani, M.: Derivative dynamic time warping. First SIAM-ICDM 1, 1–11 (2002)
Meesrikamolkul, W., Niennattrakul, V., Ratanamahatana, C.A.: Shape-based clustering for time series data. In: PaKDD, pp. 530–541 (2012)
Müller, M.: Dynamic time warping. In: Information Retrieval for Music and Motion,, pp. 69–84. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74048-3_4
Paparrizos, J., Gravano, L.: k-shape: efficient and accurate clustering of time series. In: ACM SIGMOD ICMD, pp. 1855–1870 (2015)
Vlachos, M., Kollios, G., Gunopulos, D.: Discovering similar multidimensional trajectories. In: ICDE 2002, pp. 673–684 (2002)
Zhang, Z., Tavenard, R., Bailly, A., Tang, X., Tang, P., Corpetti, T.: Dynamic time warping under limited warping path length. Inf. Sci. 393, 91–107 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Tokotoko, J., Selmaoui-Folcher, N., Govan, R., Lemonnier, H. (2021). TSX-Means: An Optimal K Search Approach for Time Series Clustering. In: Strauss, C., Kotsis, G., Tjoa, A.M., Khalil, I. (eds) Database and Expert Systems Applications. DEXA 2021. Lecture Notes in Computer Science(), vol 12924. Springer, Cham. https://doi.org/10.1007/978-3-030-86475-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-86475-0_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86474-3
Online ISBN: 978-3-030-86475-0
eBook Packages: Computer ScienceComputer Science (R0)