Clustering method for criminal crime acts using K-means and principal component analysis

Abstract

Criminality is an act of violating the values and norms of society that causes a lot of harm. Much of the criminal data is often just a collection of data that has no information. Analysis of crime data is key in efforts to reduce crime rates that provide an overview of the incidence of crime, patterns, levels of vulnerability, and the level of security of an area. This research proposes data analysis that provides an understanding of crime using data mining techniques, especially the K-means cluster method, both traditional and with principal component analysis (PCA) dimension reduction. Before the PCA process, the values are transformed first with Z score normalization. From the processing through the davies bouldin index (DBI) performance test with 3 clusters, it is concluded that traditional K-means produces a DBI Index value of 0.019 and K-means PCA of 0.299. Meanwhile, to see the optimal cluster, several iterations were performed and resulted in the most optimal DBI index of 4 clusters in K-means of 0.014 and K-means PCA of 0.172. From the performance test value, it means that in the context of clustering the traditional criminal K-means data is declared more optimal than K-means PCA.