Comparison of Model-Free Algorithms For Clustering GARCH Processes


  • Garik L. Adamyan Yerevan State University



Time series clustering, GARCH process, dynamic time warping, K-Means, K-Shape


In this paper, we evaluate several model-free algorithms for clustering time series datasets generated by GARCH processes. In extensive experiments, we generate synthetic datasets in different scenarios. Then, we compare K-Means (for Euclidian and dynamic time warping distance), K-Shape, and Kernel K-Means models with different clustering metrics. Several experiments show that the K-Means model with dynamic time warping distance archives comparably better results. However, the considered models have significant shortcomings in improving the clustering accuracy when the amount of information (the minimum length of the time series) increases, and in performing accurate clustering when data is unbalanced or clusters are overlapping.


S. Aghabozorgi, A. Seyed Shirkhorshidi, and T. Ying Wah, “Time-series clustering a decade review,” Information Systems, vol. 53, p. 1638, 2015.

M. Corduas and D. Piccolo, “Time series clustering and classification by the autoregressive metric,” Computational Statistics amp; Data Analysis, vol. 52, no. 4, p. 18601872, 2008.

Y. Xiong and D.-Y. Yeung, “Mixtures of arma models for model-based time series clustering,” 2002 IEEE International Conference on Data Mining, 2002. Proceedings.

A. Javed, B. S. Lee, and D. M. Rizzo, “A benchmark study on time series clustering,” Machine Learning with Applications, vol. 1, p. 100001, 2020.

N. Begum, L. Ulanova, J. Wang, and E. Keogh, “Accelerating dynamic time warping clustering with a novel admissible pruning strategy,” Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015.

J. Paparrizos and L. Gravano, “Fast and accurate time-series clustering,” ACM Transactions on Database Systems, vol. 42, no. 2, p. 149, 2017.

R. Tavenard, J. Faouzi, G. Vandewiele, F. Divo, G. Androz, C. Holtz, M. Payne, R. Yurchak, M. Rußwurm, K. Kolar, and E. Woods, “Tslearn, a machine learning toolkit for time series data,” Journal of Machine Learning Research, vol. 21, no. 118, pp. 1–6, 2020.

E. Keogh and S. Kasetty Data Mining and Knowledge Discovery, vol. 7, no. 4, pp. 349–371, 2003.

Y. Chen, E. Keogh, B. Hu, N. Begum, A. Bagnall, A. Mueen, and G. Batista, “The ucr time series classification archive,” July 2015. eamonn/timeseriesdata/.

S. P. Daz and J. A. Vilar, “Comparing several parametric and nonparametric approaches to time series clustering: A simulation study,” Journal of Classification, vol. 27, no. 3, pp. 333–362, 2010.

P. DUrso, L. De Giovanni, R. Massari, and D. Di Lallo, “Noise fuzzy clustering of time series by autoregressive metric,” METRON, vol. 71, no. 3, p. 217243, 2013.

T. Bollerslev, “Generalized autoregressive conditional heteroskedasticity,” Journal of Econometrics, vol. 31, no. 3, p. 307327, 1986.

L. Hentschel, “All in the family nesting symmetric and asymmetric garch models,” Journal of Financial Economics, vol. 39, no. 1, p. 71104, 1995.

J. Park, J. Baek, and S. Hwang, “Persistent-threshold-garch processes: Model and application,” Statistics amp; Probability Letters, vol. 79, no. 7, p. 907914, 2009.

A. M. Lindner, “Stationarity, mixing, distributional properties and moments of garch(p, q)processes,” Handbook of Financial Time Series, p. 4369, 2009.

Dynamic Time Warping, pp. 69–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.

F. Petitjean, A. Ketterlin, and P. Ganarski, “A global averaging method for dynamic time warping, with applications to clustering,” Pattern Recognition, vol. 44, no. 3, pp. 678–693, 2011.

J. Paparrizos and L. Gravano, “K-shape,” Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 2015.

I. S. Dhillon, Y. Guan, and B. Kulis, “Kernel k-means,” Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining - KDD ’04, 2004.

M. Cuturi, “Fast global alignment kernels,” in ICML, 2011.

L. Hubert and P. Arabie, “Comparing partitions,” Journal of Classification, vol. 2, no. 1, p. 193218, 1985.

J. M. Santos and M. Embrechts, „On the use of the adjusted rand index as a metric for evaluating supervised classification,"Artificial Neural Networks ICANN 2009, p. 175-184, 2009.

S. Romano, N. the Vinh, J. C. Bailey, and K. M. Verspoor, “Adjusting for chance clustering comparison measures ,"Journal of Machine Learning (JMLR), pp. 4635-4666, vol. 17, no. 1, 2016.

B. Krawczyk, „Learning from imbalanced data: Open challenges and future directions, "Progress in Artificial Intelligence, vol. 5, no. 4, p. 221-232, 2016.




How to Cite

Adamyan, G. L. (2022). Comparison of Model-Free Algorithms For Clustering GARCH Processes. Mathematical Problems of Computer Science, 58, 32–41.