Implementation Of Purity K-Means Algorithm In Accident Data Clustering In North Padang Lawas District

Authors

  • Khopipah Parawansah Siregar Universitas Malikussaleh
  • Bustami Bustami Information Engineering, Universitas Malikussaleh, Aceh, Lhokseumawe, 24353, Indonesia
  • Sujacka Retno Information Engineering, Universitas Malikussaleh, Aceh, Lhokseumawe, 24353, Indonesia

Keywords:

Traffic Accidents, K-Means Purity Algorithm, Data Mining, North Padang Lawas

Abstract

Traffic safety is an important issue, especially in areas with high accident rates, such as North Padang Lawas Regency in North Sumatra. This study uses the K-Means Purity Algorithm  to group regions based on the level of vulnerability to traffic accidents. The data analyzed includes the number of accidents, deaths, serious injuries, and minor injuries from 2019 to 2023. The results of clustering show that some sub-districts have fluctuating levels of vulnerability. Batang Onang District, for example, was categorized as "Not Vulnerable" in 2019 and 2021, but increased to "Vulnerable" in 2020, 2022, and 2023, indicating a spike in risk. In contrast, Dolok District is mostly in the "Not Vulnerable" category, except in 2023. East Halongonan sub-district is almost always in the "Vulnerable" category, indicating a consistently high risk, while Hulu Sihapas and Simangambat experience fluctuations in vulnerability levels from year to year. Ujung Batu, which is generally classified as "Not Vulnerable," indicates an increased risk in certain years. In conclusion, the K-Means algorithm successfully maps accident-prone areas, providing important insights for more effective interventions. This information can help the government in designing better road safety strategies, such as infrastructure improvements and traffic safety awareness campaigns, to reduce future accidents.

Keywords: Traffic Accidents, K-Means Purity Algorithm, Data Mining, North Padang Lawas, Accident Zoning

References

[1] J. Yang et al., “Brief introduction of medical database and data mining technology in big data era,” J. Evid. Based. Med., vol. 13, no. 1, pp. 57–69, 2020, doi: 10.1111/jebm.12373.

[2] E. E. Pratama, Helen Sastypratiwi, and Yulianti, “Analisis Kecenderungan Informasi Terkait Covid-10 Berdasarkan Big Data Sosial Media dengan Menggunakan Metode Data Mining,” J. Inform. Polinema, vol. 7, no. 2, pp. 1–6, 2021, doi: 10.33795/jip.v7i2.453.

[3] R. K. Dinata, H. Novriando, N. Hasdyna, and S. Retno, “Reduksi Atribut Menggunakan Information Gain untuk Optimasi Cluster Algoritma K-Means,” J. Edukasi dan Penelit. Inform., vol. 6, no. 1, p. 48, 2020, doi: 10.26418/jp.v6i1.37606.

[4] L. M. Harahap, W. Fuadi, L. Rosnita, E. Darnila, and R. Meiyanti, “Klastering Sayuran Unggulan Menggunakan Algoritma K-Means,” J. Tek. Inform. dan Sist. Inf., vol. 8, no. 3, pp. 567–579, 2022, doi: 10.28932/jutisi.v8i3.5277.

[5] R. Risawandi and Y. Afrillia, “Geographic Information System Mapping Of Criminality Villed Areas In Lhokseumawe Using K-Means Method,” J. Informatics Telecommun. Eng., vol. 5, no. 2, pp. 442–451, 2022, doi: 10.31289/jite.v5i2.6265.

[6] mohamad jajuli nurul rohmawati, sofi defiyanti, “Implementasi Algoritma K-Means Dalam Pengklasteran Mahasiswa Pelamar Beasiswa,” Jitter 2015, vol. I, no. 2, pp. 62–68, 2015.

[7] S. Retno, “Peningkatan Akurasi Algoritma K-Means Dengan Clustering Purity Sebagai Titik Pusat Cluster Awal (Centroid),” Tesis, no. July 2019, pp. 1–86, 2019, [Online]. Available: https://repositori.usu.ac.id/bitstream/handle/123456789/16782/177038001.pdf?sequence=1&isAllowed=y

[8] Siradjuddiin, Algoritma Pemrograman dengan Menggunakan Python, no. September. 2018.

Downloads

Published

2024-12-27

Issue

Vol. 2 (2024): Proceedings of International Conference on Multidisciplinary Engineering (ICOMDEN)

Section

Articles

License

Copyright (c) 2024 Khopipah Parawansah Siregar, Bustami Bustami, Sujacka Retno

Creative Commons License

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

Copyright Notice

Authors published in this journal agree to the following terms:
1. The copyright of each article is retained by the author (s).
2. The author grants the journal the first publication rights with the work simultaneously licensed under the Creative Commons Attribution License, allowing others to share the work with an acknowledgment of authorship and the initial publication in this journal.
3. Authors may enter into separate additional contractual agreements for the non-exclusive distribution of published journal versions of the work (for example, posting them to institutional repositories or publishing them in a book), with acknowledgment of their initial publication in this journal.
4. Authors are permitted and encouraged to post their work online (For example in the Institutional Repository or on their website) before and during the submission process, as this can lead to productive exchanges, as well as earlier and larger citations of published work.
5. Articles and all related material published are distributed under a Creative Commons Attribution-ShareAlike 4.0 International License.