Cluster analysis for reducing city crime rates

Adel Ali Alkhaibari, Ping-Tsai Chung
{"title":"Cluster analysis for reducing city crime rates","authors":"Adel Ali Alkhaibari, Ping-Tsai Chung","doi":"10.1109/LISAT.2017.8001983","DOIUrl":null,"url":null,"abstract":"Data analysis plays an indispensable role in the knowledge discovery process of extracting of interesting patterns or knowledge for understanding various phenomena or wide applications. Visual Data Mining is further presenting implicit but useful knowledge from large data sets using visualization techniques, to create visual images which aid in the understanding of complex, often massive representations of data. As the amount of data managed in a database increases, the need to simplify the vast amount of data also increases. Cluster analysis is the process of classifying a large group of data items into smaller groups that share the same or similar properties. In this paper, different Clustering algorithms such as K-Means clustering, agglomerative clustering were studied and applied to the Stop, Question and Frisk Report Database, City of New York, Police Department, NYPD, for analyzing the location of the crime and stopped people using the reason of stopped in order to reduce city crime rates. Our analytic and visual results revealed that the best clustering algorithm is K-Means algorithm, and its good features ensuring that the models are helpful.","PeriodicalId":370931,"journal":{"name":"2017 IEEE Long Island Systems, Applications and Technology Conference (LISAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Long Island Systems, Applications and Technology Conference (LISAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LISAT.2017.8001983","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Data analysis plays an indispensable role in the knowledge discovery process of extracting of interesting patterns or knowledge for understanding various phenomena or wide applications. Visual Data Mining is further presenting implicit but useful knowledge from large data sets using visualization techniques, to create visual images which aid in the understanding of complex, often massive representations of data. As the amount of data managed in a database increases, the need to simplify the vast amount of data also increases. Cluster analysis is the process of classifying a large group of data items into smaller groups that share the same or similar properties. In this paper, different Clustering algorithms such as K-Means clustering, agglomerative clustering were studied and applied to the Stop, Question and Frisk Report Database, City of New York, Police Department, NYPD, for analyzing the location of the crime and stopped people using the reason of stopped in order to reduce city crime rates. Our analytic and visual results revealed that the best clustering algorithm is K-Means algorithm, and its good features ensuring that the models are helpful.
降低城市犯罪率的聚类分析
数据分析在知识发现过程中发挥着不可或缺的作用,它可以提取有趣的模式或知识,用于理解各种现象或广泛应用。可视化数据挖掘是利用可视化技术从大型数据集中进一步呈现隐含但有用的知识,以创建可视化图像,帮助理解复杂的、通常是海量的数据表示。随着数据库管理数据量的增加,简化海量数据的需求也随之增加。聚类分析是将一大组数据项分类为具有相同或相似属性的较小组群的过程。本文研究了不同的聚类算法,如 K-Means 聚类和聚类聚类,并将其应用于纽约市警察局的拦截、盘问和搜身报告数据库,以分析犯罪地点和使用拦截理由拦截的人员,从而降低城市犯罪率。我们的分析和视觉结果表明,最佳聚类算法是 K-Means 算法,其良好的特性确保了模型的有用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信