Detecting Hotspots in Geographic Networks

geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train, or highway network) together with a set of sites which are located on the network (for example, accident locations or crime scenes), we want to find a connected subnetwork F of N of small total length that contains many sites. That is, we are searching for a subnetwork F that spans a cluster of sites which are close with respect to the network distance.

[1]  Jerry H. Ratcliffe,et al.  The Hotspot Matrix: A Framework for the Spatio‐Temporal Targeting of Crime Reduction , 2004 .

[2]  Isabelle Thomas,et al.  Spatial clustering of traffic accidents using distances along the network , 2006 .

[3]  Isabelle Thomas,et al.  Intra-urban location and clustering of road accidents using GIS: a Belgian example , 2004, Int. J. Geogr. Inf. Sci..

[4]  Rod R. Blagojevich.  ILLINOIS CRIMINAL JUSTICE INFORMATION AUTHORITY , 2003 .

[5]  David O'Sullivan,et al.  Geographic Information Analysis , 2002 .

[6]  Crime Mapping and Analysis by Community Organizations , 2001 .

[7]  Ke Chen,et al.  The orienteering problem in the plane revisited , 2006, SCG '06.

[8]  Jiawei Han,et al.  Geographic Data Mining and Knowledge Discovery , 2001 .

[9]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[10]  Atsuyuki Okabe,et al.  SANET: A Toolbox for Spatial Analysis on a Network , 2006 .

[11]  Santosh S. Vempala,et al.  New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..

[12]  David R. Karger,et al.  Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[13]  Giri Narasimhan,et al.  Resource-constrained geometric network optimization , 1998, SCG '98.

[14]  Michael J. McCullagh,et al.  Aoristic Crime Analysis , 1998, Int. J. Geogr. Inf. Sci..

[15]  N. Levine.  Crime Mapping and the CrimeStat Program , 2006 .

[16]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

[17]  Steven Skiena,et al.  Lowest common ancestors in trees and directed acyclic graphs , 2005, J. Algorithms.

[18]  R. E. Pippert,et al.  The number of labeled dissections of ak-ball , 1971 .

[19]  Shashi Shekhar,et al.  Discovering and Quantifying Mean Streets : A Summary of Results ∗ , 2007 .

[20]  Günter Rote.  Binary trees having a given number of nodes with 0 , 1 , and 2 children , 2002 .

[21]  Hans L. Bodlaender,et al.  Treewidth: Structure and Algorithms , 2007, SIROCCO.

[22]  Jean-Claude Thill,et al.  Local Indicators of Network-Constrained Clusters in Spatial Point Patterns , 2007 .

[23]  Peter A. Rogerson,et al.  Spatial Analysis and GIS , 1994 .

[24]  Atsuyuki Okabe,et al.  Spatial analysis of roadside Acacia populations on a road network using the network K-function , 2004, Landscape Ecology.