CORC  > 清华大学
Optimal clustering algorithm for crime spatial aggregation states analysis
Yan Jun ; Yuan Hongyong ; Shu Xueming ; Zhong Shaobo
2010-10-12 ; 2010-10-12
关键词Practical Theoretical or Mathematical/ optimisation pattern clustering police data processing resource allocation/ optimal clustering algorithm crime spatial aggregation states analysis bandwidth selection density-based clustering dynamic optimization method neighbouring grid distance threshold neighbouring point distance threshold police resource allocation crime area detection/ C7130 Public administration C6130 Data handling techniques C1180 Optimisation techniques
中文摘要The optimal bandwidth choose is a key parameter in the crime spatial aggregation states analysis method. The bandwidth is selected by coupling DENCLUE (Density-based Clustering) with the dynamic optimization method to cluster data for detecting high crime areas. Tests on a number of crime data sets show that the method gives precise locations of the cluster centers and density variations. When the ratio of the element side, the neighbouring grid distance threshold and the neighbouring point distance threshold is 2 : 3 : 1, the algorithm gives the best results. Analysis of the distribution of crime hot spots can assist police in allocating police resources to these high-crime areas.
语种中文
出版者Tsinghua University Press ; China
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/82457]  
专题清华大学
推荐引用方式
GB/T 7714
Yan Jun,Yuan Hongyong,Shu Xueming,et al. Optimal clustering algorithm for crime spatial aggregation states analysis[J],2010, 2010.
APA Yan Jun,Yuan Hongyong,Shu Xueming,&Zhong Shaobo.(2010).Optimal clustering algorithm for crime spatial aggregation states analysis..
MLA Yan Jun,et al."Optimal clustering algorithm for crime spatial aggregation states analysis".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace