방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Crime Mapping× | Kernel Density Crime Mapping× | |
|---|---|---|
| 분야 | Criminology | Criminology |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 2005 | 2008 |
| 창시자≠ | Rachel Boba Santos, Spencer Chainey & Jerry Ratcliffe (modern synthesis) | Bernard Silverman (KDE); Spencer Chainey (crime mapping application) |
| 유형≠ | Geographic information analysis of crime locations | Nonparametric density estimation for crime surfaces |
| 원전≠ | Boba Santos, R. (2017). Crime Analysis with Crime Mapping (4th ed.). SAGE Publications. ISBN: 9781506331034 | 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 ↗ |
| 별칭 | Geographic Crime Analysis, Crime Cartography, GIS Crime Mapping, Spatial Crime Analysis | KDE Crime Mapping, Crime Density Surface Mapping, Hot Spot Density Mapping, Kernel Smoothing of Crime Events |
| 관련 | 4 | 4 |
| 요약≠ | Crime mapping is the practice of geocoding crime incidents to their locations and using geographic information systems (GIS) to visualize and analyze where crime concentrates. It spans simple pin maps, area-based choropleth maps, and continuous density surfaces, and underpins the geographic side of modern crime analysis — from CompStat briefings to problem-oriented policing. | 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. |
| ScholarGate데이터셋 ↗ |
|
|