Clustering stationary and non-stationary time series based on autocorrelation distance of hierarchical and k-means algorithms
Mohammad Alfan Alfian Riyadi, Dian Sukma Pratiwi, Aldho Riski Irawan and 1 more
IJAIN (International Journal of Advances in Intelligent Informatics) · 2017
doi:10.26555/ijain.v3i3.98 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-SA
References17
17 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.