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.
手法の全文を読む
無料アカウントでログインすると、このセクションを読めます。
手法マップ
関連する手法の近傍 — ノードを選択して探索できます。
出典
- 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
このページの引用方法
ScholarGate. (2026, June 22). Kernel Density Estimation for Crime Mapping. ScholarGate. https://scholargate.app/ja/criminology/kernel-density-crime-mapping
どの手法を選ぶ？
この手法を最も近い類縁の手法と並べ、両者を見比べてください — ライブラリは本を机の上に並べるだけ。選ぶのはあなたです。
- Crime Hot Spot AnalysisCriminology↔ 比較
- Crime MappingCriminology↔ 比較
- Risk Terrain Modeling (Criminology)Criminology↔ 比較
- 時空間カーネル密度推定（ST-KDE）空間分析↔ 比較