Application Of The Dbscan Algorithm For Clustering Criminal Evidence Data At The Bengkulu District Attorney's Office

  • Agung Biantoro Mahendra Universitas Dehasen Bengkulu
  • Dewi Suranti Universitas Dehasen Bengkulu
  • Prahasti Prahasti Universitas Dehasen Bengkulu
Keywords: DBSCAN, Clustering, Criminal Evidence, Silhouette Score, Density-Based Clustering

Abstract

Evidence management at the Bengkulu District Attorney's Office was previously handled manually, which complicated storage and retrieval as caseloads increased. This study implements the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm to group 150 evidence records based on evidence type, quantity, date received, and storage location. A quantitative-experimental design was used, covering data pre-processing, encoding, normalization, and clustering with Python on Google Colab, using epsilon = 0.8 and minimum points = 3. DBSCAN produced four clusters and identified eight records as noise, achieving a Silhouette Score of 0.4757, indicating moderate clustering quality. The clusters were respectively dominated by electronics, vehicles, sharp weapons, and documents, each linked to a separate storage warehouse. These findings show that DBSCAN can support more structured and efficient evidence storage and retrieval governance within the prosecutor's office.

Downloads

Download data is not yet available.
Published
2026-10-27
How to Cite
Mahendra, A., Suranti, D., & Prahasti, P. (2026). Application Of The Dbscan Algorithm For Clustering Criminal Evidence Data At The Bengkulu District Attorney’s Office. Jurnal Media Computer Science, 5(4), 1723-1730. https://doi.org/10.37676/jmcs.v5i4.12636
Section
Articles

Most read articles by the same author(s)

<< < 1 2 3 4 5 > >>