Keywords:-

Keywords: Open Unemployment Rate, Time Series, K-Medoids, Fuzzy K-Medoids, Euclidean, Dynamic Time Warping

Article Content:-

Abstract

Open Unemployment Rate (OUR) data is a time series dataset that shows changes over time and often has similar patterns across regions. This study aims to cluster Indonesian provinces based on OUR change patterns using a whole-time-series clustering approach. Each province is treated as a single complete time series, and clustering is performed based on pattern similarities rather than only comparing values at specific time points. Two clustering methods are used: K-Medoids and Fuzzy K-Medoids. These methods are with two distance measures, Euclidean distance and Dynamic Time Warping (DTW), resulting in four clustering methods. DTW is applied to capture flexible pattern similarities in time series data, while Euclidean distance measures direct value differences. The quality of clustering results is evaluated using the silhouette coefficient. The results show that the Fuzzy K-Medoids – DTW combination with 2 clusters produces the highest silhouette score = 0.627, indicating the best clustering structure among all tested methods. These findings suggest that combining fuzzy clustering with DTW distance is more suitable for OUR data, which tend to have smooth changes and similar patterns across provinces.

References:-

References

International Monetary Fund, 2024. World Economic Outlook Database (No. 2015–2025). International Monetary Fund, Washington, D.C.

Booklet Sakernas, 2025. Badan Pusat Statistik.

Booklet Sakernas, 1st ed, 2024. . Badan Pusat Statistik.

Karim, A., Esabella, S., Kusmanto, Suryadi, S., Mardinata, E., 2024. Clusterisasi Tingkat Pengangguran Terbuka Menurut Provinsi di Indonesia Menggunakan Algoritma K-Medoids. Build. Inform. Technol. Sci. BITS 6, 1341–1351.

https://doi.org/10.47065/bits.v6i3.6198

Aqsari, H.W., Prastyo, D.D., Rahayu, S.P., 2022. Clustering Stock Prices of Financial Sector Using K-Means Clustering With Dynamic Time Warping, in: The 6th International Conference on Information Technology, Information Systems and Electrical Engineering (ICITISEE). IEEE, Surabaya, Indonesia, pp. 503–507. https://doi.org/10.1109/ICITISEE57756.2022.10057714

Izakian, H., Pedrycz, W., Jamal, I., 2015. Fuzzy clustering of time series data using dynamic time warping distance. Eng. Appl. Artif. Intell. 39, 235–244. https://doi.org/10.1016/j.engappai.2014.12.015

Holder, C., Middlehurst, M., Bagnall, A., 2023. A Review and Evaluation of Elastic Distance Functions for Time Series Clustering. Knowl. Inf. Syst. 66, 1–39. https://doi.org/10.1007/s10115-023-01952-0

Kaufman, L., Rousseeuw, P.J., 1990. Finding Groups in Data : An Introduction to Cluster Analysis, Wiley Series in Probability and Mathematical Statistics. Wiley, New York.

Aghabozorgi, S., Shirkhorshidi, A.S., Wah, T.Y., 2015. Time-series clustering – A decade review. Inf. Syst. 53, 16–38. https://doi.org/10.1016/j.is.2015.04.007

Petitjean, F., Ketterlin, A., Gancarski, P., 2011. A global averaging method for dynamic time warping, with applications to clustering. Pattern Recognit. 44.

Li, H., Wang, J., 2024. From Soft Clustering to Hard Clustering: A Collaborative Annealing Fuzzy c-Means Algorithm. IEEE Trans. Fuzzy Syst. 32, 1181–1194. https://doi.org/10.1109/TFUZZ.2023.3319663

Kaufman, L., Rousseeuw, P.J., 1990. Finding Groups in Data : An Introduction to Cluster Analysis, Wiley Series in Probability and Mathematical Statistics. Wiley, New York.

Krishnapuram, R., Joshi, A., Nasraoui, O., Yi, L., 2001. Low-complexity fuzzy relational clustering algorithms for Web mining. IEEE Trans. Fuzzy Syst. 9, 595–607. https://doi.org/10.1109/91.940964

Badan Pusat Statistik, 2025. Tingkat Pengangguran Terbuka Menurut Provinsi (Persen). Badan Pusat Statistik, Jakarta.

Downloads

Citation Tools

How to Cite
Rosanto, A., ., S., & Izati, P. (2026). K-Medoids and Fuzzy K-Medoids Methods with Euclidean Distance and Dynamic Time Warping in Time Series Data Open Unemployment Rate. International Journal Of Mathematics And Computer Research, 14(06), 6471-6477. https://doi.org/10.47191/ijmcr/v14i6.03