Method evidence record

Kernel Density Crime Mapping

Kernel density crime mapping turns a scatter of geocoded crime points into a smooth, continuous surface that shows where incidents concentrate. Each event is spread out over a small neighborhood by a kernel function, and the overlapping contributions are summed across a fine grid so that areas with many nearby crimes glow as peaks. Chainey, Tompson, and Uhlig (2008) showed that, among common hot-spot mapping techniques, kernel density estimation is one of the most accurate at predicting where future crime will occur, which is why it became the default crime-mapping surface in policing.

Sources recorded, not reviewed

Source record

Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.

Kernel Density Estimation for Crime Mapping

Taxonomic method record · process-pipeline / criminology

Chainey, S., Tompson, L., & Uhlig, S. (2008). The utility of hotspot mapping for predicting spatial patterns of crime. Security Journal, 21(1–2), 4–28. · DOI 10.1057/palgrave.sj.8350066
Silverman, B. W. (1986). Density Estimation for Statistics and Data Analysis. Chapman and Hall. · ISBN 9780412246203

Open full method

Curated claims

Claims persisted in the evidence ledger, each with its own assessment.

No curated claims yet

This view does not invent a claim assessment when the ledger has none.

Related methods

Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.

Same method familyCrime Hot Spot Analysismachine-suggested · Relational suggestion, not evidence.Taxonomic bucketCrime Mappingmachine-suggested · Relational suggestion, not evidence.Same method familyRisk Terrain Modeling (Criminology)machine-suggested · Relational suggestion, not evidence.See alsoSpace-Time Kernel Density Estimationmachine-suggested · Relational suggestion, not evidence.