The comparative analysis on the accuracy of k-NN, Naive Bayes, and Decision Tree Algorithms in predicting crimes and criminal actions in Sleman Regency

Abstract

Crime is an action which is considered as a violation of law and can harm others. Nowadays, crimes has increased with erratic patterns. Therefore, crime prevention is necessary since it will occur based on the historical data. Data mining is a technique that can be used to predict crimes that will occur. According to the previous researches, data mining techniques have several methods that can be used to predict crimes by utilizing the data of crimes that have occurred. Hence, it is necessary to conduct a comparative analysis of classification algorithms in order to obtain accurate prediction results based on the crime data in Sleman regency. The classification algorithms analyzed in this study were k-NN, Naive Bayes, and Decision Tree. Based on the three algorithms, the accuracy of k-NN with k = 5 was 57.88 percent, with k = 10 was 59.49 percent, with k = 15 is 59.38 percent, with k = 20 was 60.18 percent, and with k = 25 was 61.57 percent. Meanwhile, for the Naive Bayes algorithm, the accuracy reached 65.59 percent, and the Decision Tree algorithm reached 60.23 percent. In conclusion, the algorithm with the highest accuracy was owned by Naive Bayes.