Discovering and Quantifying Mean Streets: A Summary of Results (2007)
| Citations: | 3 - 1 self |
BibTeX
@MISC{Celik07discoveringand,
author = {Mete Celik and Shashi Shekhar and Betsy George and James P. Rogers and James A. Shine},
title = {Discovering and Quantifying Mean Streets: A Summary of Results },
year = {2007}
}
OpenURL
Abstract
Mean streets represent those connected subsets of a spatial network whose attribute values are significantly higher than expected. Discovering and quantifying mean streets is an important problem with many applications such as detecting high-crime-density streets and high crash roads (or areas) for public safety, detecting urban cancer disease clusters for public health, detecting human activity patterns in asymmetric warfare scenarios, and detecting urban activity centers for consumer applications. However, discovering and quantifying mean streets in large spatial networks is computationally very expensive due to the difficulty of characterizing and enumerating the population of streets to define a norm or expected activity level. Previous work either focuses on statistical rigor at the cost of computational exorbitance, or







