Clustering stationary and non-stationary time series based on autocorrelation distance of hierarchical and K-means algorithms

12Citations
Citations of this article
48Readers
Mendeley users who have this article in their library.

Abstract

Observing large dimension time series could be time-consuming. One identification and classification approach is a time series clustering. This study aimed to compare the accuracy of two algorithms, hierarchical cluster and K-Means cluster, using ACF’s distance for clustering stationary and non-stationary time series data. This research uses both simulation and real datasets. The simulation generates 7 stationary data models and another 7 of non-stationary data models. On the other hands, the real dataset is the daily temperature data in 34 cities in Indonesia. As a result, K-Means algorithm has the highest accuracy for both data models.

Cite

CITATION STYLE

APA

Riyadi, M. A. A., Pratiwi, D. S., Irawan, A. R., & Fithriasari, K. (2017). Clustering stationary and non-stationary time series based on autocorrelation distance of hierarchical and K-means algorithms. International Journal of Advances in Intelligent Informatics, 3(3), 154–160. https://doi.org/10.26555/ijain.v3i3.98

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free