Comparative Analysis of K-Means and K-Medoids Clustering Methods on Weather Data of Denpasar City

Bima Prihasto, Darmansyah Darmansyah, Dastin Pranata Yuda, Fauzan Maftuh Alwafi, Herliana Nur Ekawati, Yustika Perwita Sari

Abstract


By applying data mining methods, particularly clustering techniques, the weather data of Denpasar city can be grouped based on similar characteristics. This provides deep insight into weather patterns, useful for more optimised travel planning. This research positively impacts tourism, helping stakeholders understand weather patterns in more detail. Furthermore, in-depth knowledge of weather conditions improves preparedness for potential global climate change. The clustering results can be visualised in a three-dimensional cartesian diagram, providing a clear picture of the various weather conditions using attributes such as temperature, precipitation, and humidity. Through Kaggle's Denpasar Weather Data dataset, with 264,924 data and 32 columns, this study illustrates that cloudy weather dominates in the K-Means and K-Medoids clustering process on rain data within one hour. At three hours, K-Means shows the dominance of cloudy weather and the possibility of rain, while K-means dominates all clusters. At six hours, K-Means dominate in sunny and rainy weather, while K-Medoids dominate evenly in all clusters.


Keywords


K-Means; K-Medoids; Clustering; Weather

Full Text:

PDF

References


Baek, S. J. (1998). Fast clustering algorithm for vector quantisation. Electronics Letters, 34 (2), 151-152.

Coleman, G., & Andrews, H. (1979). Image segmentation by clustering. Proceedings of the IEEE, pp. 67, 773-785.

Hamerly, G. (2003). Learning the K in K-Means. Neural Information Processing Systems.

Hamerly, G., & Elkan, C. (2002). Alternatives to the k-means algorithm that find better clusterings. Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, 600-607.

Jain, A. (2000, January). Statistical Pattern Recognition: A Review. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (1), 4–37.

Jain, A., & Dubes, R. (1988). Algorithms for Clustering Data. Prentice Hall.

Jain, A. K. (1999, September 1). Data Clustering: A Review,. ACM Computing Surveys, 31 (3), 264–323.

Kaukoranta, T. (1998). A new iterative algorithm for VQ codebook generation. Proceedings 1998 International Conference on Image Processing, 589-593.

Lee, C., & Antonsson, E. (2000). Dynamic partitional clustering using evolution strategies. Conference: Industrial Electronics Society, 2000. IECON 2000. 26th Annual Conference of the IEEE., 4.

Risman, Syaripuddin, & Suyitno. (2019, May). IMPLEMENTATION OF THE DBSCAN METHOD IN GROUPING DISTRICTS/CITIES ON THE ISLAND OF KALIMANTAN BASED ON PEOPLE'S WELFARE INDICATORS. Proceedings of the National Seminar on Mathematics and Statistics, 1, 22-28.

Xiang, Z. (1997). Colour image quantisation by minimising the maximum intercluster distance. ACM Transactions on Graphics, 16 (3), 260–276.




DOI: https://doi.org/10.17509/edsence.v5i2.65925

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 Jurnal Pendidikan Multimedia (Edsence)

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Jurnal Pendidikan Multimedia (Edsence) ( p-ISSN:2685-2489 | e-ISSN:2685-2535) published by Universitas Pendidikan Indonesia (UPI)

Indexed by:

     

 

p-ISSN:2685-2489 | e-ISSN:2685-2535

 

Visitor Number :

View My Stats