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.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Metodekort
Nabolaget af beslægtede metoder — vælg en knude for at udforske.
Kilder
- 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
Sådan citerer du denne side
ScholarGate. (2026, June 22). Kernel Density Estimation for Crime Mapping. ScholarGate. https://scholargate.app/da/criminology/kernel-density-crime-mapping
Hvilken metode?
Stil denne metode ved siden af dens nærmeste slægtninge, og læs dem side om side — biblioteket lægger bøgerne på bordet; valget er dit.
- Crime Hot Spot AnalysisCriminology↔ sammenlign
- Crime MappingCriminology↔ sammenlign
- Risk Terrain Modeling (Criminology)Criminology↔ sammenlign
- Rum-tid kerne-densitetsestimering (ST-KDE)Rumlig analyse↔ sammenlign
Refereret af
Lignende metoder
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →