• Tidak ada hasil yang ditemukan

A performance comparison of euclidean, manhattan and minkowski distances in k-means clustering

N/A
N/A
Info
Unduh - Bebas
Protected

Academic year: 2024

Membagikan "A performance comparison of euclidean, manhattan and minkowski distances in k-means clustering"

Copied!
1
0
0

Memuat.... (Lihat teks lengkap sekarang)

Unduh sekarang ( 1 Halaman )

Teks penuh

(1)

A performance comparison of euclidean, manhattan and minkowski distances in k-means clustering

ABSTRACT

The Indonesian police department has a role in maintaining security and law enforcement under the Republic of Indonesia Law Number 2 of 2002. In this study, data on the crime rate in the Bontang City area has been analyzed. It becomes the basis for the Police in anticipating various crimes. The K-Means algorithm is used for data analysis. Based on the test results, there are three levels of crime: high, medium, and low. According to the analysis, the high crime rate in the Bontang City area is special case theft and vehicle theft. Furthermore, it becomes the police program to maintain personal and vehicle safety.

Referensi

Unduh sekarang ( PDF - 1 Halaman - 55.96 KB )

Dokumen terkait

A New Method To Optimize The Localization Of Sensor Node Using Derivative Harmony Search Algorithm-Based K-Means Clustering Protocol For Extended Coverage Area And Energy Efficiency In Wireless Sensor Network.

This project focuses on the Derivative Harmony Search Algorithm (DHSA) based K-means clustering protocol used to optimize the localization of sensor node in terms of energy

View of Comparison of K-Means Clustering and K-Medoids Clustering in Grouping Fresh Milk Production in Indonesia Based on DBI Value

Abstrak – Tujuan penelitian ini adalah untuk mencari pengelompokkan yang optimal dari perbandingan dua metode dalam pengelompokkan produksi susu segar menggunakan algoritma

View of Solution to Scalability and Sparsity Problems in Collaborative Filtering using K-Means Clustering and Weight Point Rank (WP-Rank

The K-Means clustering algorithm is used to overcome scalability problems, while WP-Rank is used to overcome the sparsity problem by performing an aggregation process so as to produce