Dijkstra算法
吸引子
最短路径问题
犯罪学
计算机科学
空格(标点符号)
地理
过程(计算)
心理学
数学
理论计算机科学
操作系统
图形
数学分析
作者
Andrew A. Reid,Richard Frank,Natalia Iwanski,Vahid Dabbaghian,Patricia L. Brantingham
标识
DOI:10.1177/0022427813483753
摘要
Objectives: The main objective of this study was to see if the characteristics of offenders’ crimes exhibit spatial patterning in crime neutral areas by examining the relationship between simulated travel routes of offenders along the physical road network and the actual locations of their crimes in the same geographic space. Method: This study introduced a Criminal Movement model (CriMM) that simulates travel patterns of known offenders. Using offenders’ home locations, locations of major attractors (e.g., shopping centers), and variations of Dijkstra’s shortest path algorithm we modeled the routes that offenders are likely to take when traveling from their home to an attractor. We then compare the locations of offenders’ crimes to these paths and analyze their proximity characteristics. This process was carried out using data on 7,807 property offenders from five municipalities in the Greater Vancouver Regional District (GVRD) in British Columbia, Canada. Results: The results show that a great proportion of crimes tend to be located geographically proximal to the simulated travel paths with a distance decay pattern characterizing the distribution of distance measures. Conclusion: These results lend support to Crime Pattern Theory and the idea that there is an underlying pattern to crimes in crime neutral areas.
科研通智能强力驱动
Strongly Powered by AbleSci AI