Advertisement

Many Candidates

Chapter
  • 808 Downloads
Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)

Abstract

This chapter explores the challenge where the search space itself may have potentially large number of candidates when summarizing spatial network data. For example, in a transportation planning scenario, there may be as many as \(10^{16}\) shortest paths in a given dataset with hundreds of millions of activities or road network nodes. For large roadmaps such as the 100 million road-segments in the US, this results in prohibitive shortest path computation times. This challenge may be formalized as the significant route discovery problem where given a spatial network, a collection of activities (e.g., pedestrian fatality reports, crime reports), and a likelihood threshold \(\theta \), the goal is to find all shortest paths in the spatial network where the concentration of activities is unusually high (i.e., statistically significant) and the likelihood exceeds \(\theta \). Depending on the domain, an activity may be the location of a pedestrian fatality, a carjacking, a train accident, etc.

Keywords

Likelihood Ratio Short Path Road Network Activity Density Spatial Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Oliver, D., Shekhar, S., Zhou, X., Eftelioglu, E., Evans, M. R., & Zhuang, Q., et al. (2001). Significant route discovery: A summary of results. In Geographic information science (pp. 284–300). Berlin: Springer International Publishing.Google Scholar
  2. 2.
    Shekhar, S., Evans, M. R., Kang, J. M., & Mohan, P. (2011). Identifying patterns in spatial information: A survey of methods. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 1(3), 193–214.Google Scholar
  3. 3.
    Kulldorff, M. (1997). A spatial scan statistic. Communications in Statistics-Theory and methods, 26(6), 1481–1496.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Neill, D. B., & Moore, A. W. (2004). Rapid detection of significant spatial clusters. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 256–265). ACM.Google Scholar
  5. 5.
    Kulldorff, M. (1999). Spatial scan statistics: models, calculations, and applications. In Scan statistics and applications (pp. 303–322). Birkhuser Boston.Google Scholar
  6. 6.
    Costa, M. A., Assuno, R. M., & Kulldorff, M. (2012). Constrained spanning tree algorithms for irregularly-shaped spatial clustering. Computational Statistics and Data Analysis, 56(6), 1771–1783.MathSciNetCrossRefGoogle Scholar
  7. 7.
    Duczmal, L., & Assuncao, R. (2004). A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters. Computational Statistics and Data Analysis, 45(2), 269–286.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Shi, L., & Janeja, V. P. (2011). Anomalous window discovery for linear intersecting paths. IEEE Transactions on Knowledge and Data Engineering, 23(12), 1857–1871.CrossRefGoogle Scholar
  9. 9.
    Janeja, V. P., & Atluri, V. (2005). LS 3: A linear semantic scan statistic technique for detecting anomalous windows. In Proceedings of the 2005 ACM symposium on applied computing (pp. 493-497). ACM.Google Scholar
  10. 10.
    Shekhar, S., & Liu, D. R. (1997). CCAM: A connectivity-clustered access method for networks and network computations. IEEE Transactions on Knowledge and Data Engineering, 9(1), 102–119.CrossRefGoogle Scholar
  11. 11.
    Meehan, Bill. (2013). Modeling electric distribution with GIS. Redlands: Esri Press.Google Scholar
  12. 12.
    Cormen, T. H. ((2009)). Introduction to algorithms. MIT press.Google Scholar
  13. 13.
    Kulldorff, M., Rand, K., Gherman, G., Williams, G., & DeFrancesco, D. (1998). SaTScan v 2.1: Software for the spatial and space-time scan statistics. Bethesda, MD: National Cancer Institute.Google Scholar
  14. 14.
    Fatality Analysis Reporting System (FARS) Encyclopedia, National Highway Traffic Safety Administration (NHTSA), http://www.nhtsa.gov/FARS
  15. 15.
    Quantum GIS OpenLayers Plugin. Retrieved January 23, 2014. http://plugins.qgis.org/plugins/openlayers_plugin
  16. 16.
    US Census Bureau 2010 Census TIGER/Line Shapefiles. http://www.census.gov/geo/www/tiger/tgrshp2010/tgrshp2010.html
  17. 17.
    Ernst, M., Lang, M., & Davis, S. (2011). Dangerous by design: Solving the epidemic of preventable pedestrian deaths, Transportation for America: Surface Transportation Policy Partnership, Washington, DC.Google Scholar
  18. 18.
    Ester, M., Kriegel, H. P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd, 96(34), 226–231.Google Scholar
  19. 19.
    MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, 1(14), 281–297.MathSciNetzbMATHGoogle Scholar
  20. 20.
    Oliver, D., Shekhar, S., Kang, J. M., Laubscher, R., Carlan, V., & Bannur, A. (2014). A k-main routes approach to spatial network activity summarization. IEEE Transactions on Knowledge and Data Engineering, 26(6), 1464–1478.CrossRefGoogle Scholar
  21. 21.
    Buchin, K., Cabello, S., Gudmundsson, J., Lffler, M., Luo, J., Rote, G., et al. (2010). Finding the most relevant fragments in networks. Journal of Graph Algorithms and Applications, 14(2), 307–336.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© The Author(s) 2016

Authors and Affiliations

  1. 1.ESRIRedlandsUSA

Personalised recommendations