当前位置: X-MOL 学术Journal of Criminal Justice › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The sensitivity of repeat and near repeat analysis to geocoding algorithms
Journal of Criminal Justice ( IF 3.3 ) Pub Date : 2020-09-01 , DOI: 10.1016/j.jcrimjus.2020.101721
Cory P. Haberman , David Hatten , Jeremy G. Carter , Eric L. Piza

Abstract Purpose To determine if repeat and near repeat analysis is sensitive to the geocoding algorithm used for the underlying crime incident data. Methods The Indianapolis Metropolitan Police Department provided 2016 crime incident data for five crime types: (1) shootings, (2) robberies, (3) residential burglaries, (4) theft of automobiles, and (5) theft from automobiles. The incident data were geocoded using a dual ranges algorithm and a composite algorithm. First, descriptive analysis of the distances between the two point patterns were conducted. Second, repeat and near repeat analysis was performed. Third, the resulting repeat and near repeat patterns were compared across geocoding algorithms. Results The underlying point patterns and repeat and near repeat analyses were similar across geocoding algorithms. Conclusions While detailing geocoding processes increases transparency and future researchers can conduct sensitivity results to ensure their findings are robust, dual ranges geocoding algorithms are likely adequate for repeat and near repeat analysis.

中文翻译:

重复和近似重复分析对地理编码算法的敏感性

摘要 目的确定重复和近似重复分析是否对用于基础犯罪事件数据的地理编码算法敏感。方法 印第安纳波利斯大都会警察局提供了 2016 年五种犯罪类型的犯罪事件数据:(1) 枪击、(2) 抢劫、(3) 住宅盗窃、(4) 汽车盗窃和 (5) 汽车盗窃。事件数据使用双范围算法和复合算法进行地理编码。首先,对两点图案之间的距离进行了描述性分析。其次,进行了重复和近似重复分析。第三,在地理编码算法中比较了由此产生的重复和近似重复模式。结果 不同地理编码算法的基础点模式以及重复和近似重复分析是相似的。
更新日期:2020-09-01
down
wechat
bug