A performance comparison of euclidean, manhattan and minkowski distances in k-means clustering

• المؤلفون الرئيسيون: Haviluddin Haviluddin, Muhammad Iqbal, Gubtha Mahendra Putra, Novianti Puspitasari, Hario Jati Setyadi, Felix Andika Dwiyanto, Aji Prasetya Wibawa, Rayner Alfred
• التنسيق: Proceedings
• اللغة: English; English
• منشور في: Institute of Electrical and Electronics Engineers 2021
• الموضوعات: DS611-649 Indonesia (Dutch East Indies); QA1-43 General
• الوصول للمادة أونلاين: https://eprints.ums.edu.my/id/eprint/31909/1/A%20performance%20comparison%20of%20euclidean%2C%20manhattan%20and%20minkowski%20distances%20in%20k-means%20clustering.ABSTRACT.pdf; https://eprints.ums.edu.my/id/eprint/31909/2/A%20Performance%20Comparison%20of%20Euclidean%2C%20Manhattan%20and%20Minkowski%20Distances%20in%20K-Means%20Clustering.pdf; https://eprints.ums.edu.my/id/eprint/31909/; https://ieeexplore.ieee.org/document/9392053

The Indonesian police department has a role in maintaining security and law enforcement under the Republic of Indonesia Law Number 2 of 2002. In this study, data on the crime rate in the Bontang City area has been analyzed. It becomes the basis for the Police in anticipating various crimes. The K-Means algorithm is used for data analysis. Based on the test results, there are three levels of crime: high, medium, and low. According to the analysis, the high crime rate in the Bontang City area is special case theft and vehicle theft. Furthermore, it becomes the police program to maintain personal and vehicle safety.