首页> 外文会议>International Conference on Science in Information Technology >A Performance Comparison of Euclidean, Manhattan and Minkowski Distances in K-Means Clustering
【24h】

A Performance Comparison of Euclidean, Manhattan and Minkowski Distances in K-Means Clustering

机译:欧几里德,曼哈顿和Minkowski距离在k均值聚类中的性能比较

获取原文

摘要

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.
机译:印度尼西亚警察局在2002年第2号法律规定的印度尼西亚共和国的安全和执法方面发挥了作用。在本研究中,分析了关于滨唐市区犯罪率的数据。它成为预期各种罪行的警方的基础。 K-means算法用于数据分析。根据测试结果,有三个犯罪级别:高,中等和低。根据分析,滨唐市区的高犯罪率是特殊案例盗窃和车辆盗窃。此外,它成为维持个人和车辆安全的警察计划。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号