Analisis Pengelompokan Jenis Kejahatan di Sumatera Utara Berdasarkan Pola Kejadian Tahunan Menggunakan Algoritma K-Means Clustering

This study aims to cluster various types of crimes occurring in North Sumatra Province based on annual incident patterns using the K-Means clustering algorithm. The data utilized are secondary data obtained from the Central Bureau of Statistics (BPS), comprising 34 types of crimes recorded from 2007 to 2021. Prior to clustering, data were normalized using the Z-score standardization method to ensure uniform scaling across variables. The optimal number of clusters was determined using the Elbow Method and Silhouette Plot. The analysis results indicate that four clusters (k = 4) provide the best balance between model complexity and clustering quality. Each cluster reveals distinct crime patterns in terms of frequency and trend stability over the years. The clustering results offer a clearer understanding of crime characteristics in the region and can serve as a foundation for more targeted policy-making, such as resource allocation for law enforcement and data-driven crime prevention strategies. This study demonstrates that data mining approaches, particularly the K-Means algorithm, can significantly contribute to a systematic and comprehensive understanding of crime patterns.

Authors

Institutions

Publication Details

Journal
AKSIOMA Jurnal Sains Ekonomi dan Edukasi
Published
2025-06-19
DOI
https://doi.org/10.62335/aksioma.v2i6.1366
Primary Topic
Data Mining and Machine Learning Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analisis Pengelompokan Jenis Kejahatan di Sumatera Utara Berdasarkan Pola Kejadian Tahunan Menggunakan Algoritma K-Means Clustering

Mery Christyn Lubis, Sandi Dwi Payana, Hotnauli Roni Arta Panjaitan, Michael Dolly Sianturi et al.
AKSIOMA Jurnal Sains Ekonomi dan Edukasi
Data Mining and Machine Learning Applications
article

Analisis Pengelompokan Jenis Kejahatan di Sumatera Utara Berdasarkan Pola Kejadian Tahunan Menggunakan Algoritma K-Means Clustering

Mery Christyn Lubis, Sandi Dwi Payana, Hotnauli Roni Arta Panjaitan, Michael Dolly Sianturi, عبدالمجيد محمد حمودي
article en

Abstract

This study aims to cluster various types of crimes occurring in North Sumatra Province based on annual incident patterns using the K-Means clustering algorithm. The data utilized are secondary data obtained from the Central Bureau of Statistics (BPS), comprising 34 types of crimes recorded from 2007 to 2021. Prior to clustering, data were normalized using the Z-score standardization method to ensure uniform scaling across variables. The optimal number of clusters was determined using the Elbow Method and Silhouette Plot. The analysis results indicate that four clusters (k = 4) provide the best balance between model complexity and clustering quality. Each cluster reveals distinct crime patterns in terms of frequency and trend stability over the years. The clustering results offer a clearer understanding of crime characteristics in the region and can serve as a foundation for more targeted policy-making, such as resource allocation for law enforcement and data-driven crime prevention strategies. This study demonstrates that data mining approaches, particularly the K-Means algorithm, can significantly contribute to a systematic and comprehensive understanding of crime patterns.

AKSIOMA Jurnal Sains Ekonomi dan EdukasiVol. 2(6)
State University of Medan (ID)
Peace, Justice and strong institutions
Openalex Percentile: Top 80%
Data Mining and Machine Learning Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.