Perbandingan Kinerja Algoritma K-Means dan K-Medoids Dalam Klasterisasi Jumlah Tindak Pidana Kejahatan Berbasis Wilayah Kepolisian Daerah

Abstract

Criminal acts are often a problem that occurs in Indonesia. Where currently the number of reports handled by the police regarding criminal acts is always there every day. Indonesia's population is increasing and the background of perpetrators who are unemployed is often one of the reasons why the police find it difficult to resolve criminal acts that occur due to limited human resources. To overcome this problem, information is needed that provides areas in Indonesia where criminal acts frequently occur so that the police can make decisions to allocate human resources to protect those jurisdictions from criminal acts that occur. Using data on criminal offenses and the employment of criminal offenders, namely not working from 2021, data was taken from the National Police Criminal Investigation Unit's Pusiknas Annual Journal. The data will be clustered using data mining techniques using the K-Means and K-Medoids algorithms. These 2 algorithms produced 2 clusters with the smallest Davies Bouldin index value found in the K-Means algorithm with a value of 0.272. With the research results which produced 2 clusters, it can be concluded that there are categories of high crime and low crime.