Abstract
Geospatial abduction problems (GAPsfor short) were introduced in Shakarian et al. (Gaps: Geospatial abduction problems. ACM Transactions on Intelligent Systems and Technology. (2011)). Given a set \(\mathcal{O}\) of observations, GAPstry to find a set of “partner” locations (points) that best explain those observations. For instance, the observations may refer to improvised-explosive device (IED) attacks (or burglaries) and the partner locations may refer to caches supporting those attacks (or the burglar’s house/office). A region-based GAP(or RGAP) tries to find a set of regions that best explain the observations. We study the complexity and mathematical properties of region-based GAPswhere we vary the shape of the region(s) we are seeking. We develop several exact and approximate algorithms for RGAPs, often with guarantees – we also explore practical implementation issues. We performed experiments where we attempted to use RGAPsto locate weapons caches in Baghdad based on IED attack locations. Our implementation was able to find regions that contained multiple weapons caches (on average 1. 7 cache sites) as well as a significantly higher density such caches (8 caches per square kilometer vs. the city-wide average of 0. 4). Further, the algorithm ran quickly, performing computation in just over 2 s on commodity desktop hardware.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brantingham, P., Brantingham, P.: Crime Pattern Theory. In: Wortley, R., Mazerolle, L. (eds.) Enviromental Criminology and Crime Analysis, pp. 78–93. Willan Publishing, UK (2008)
Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite vc-dimension. Discrete Comput. Geom. 14, 293–302 (1995)
Bylander, T., Allemang, D., Tanner, M.C., Josephson, J.R.: The Computational Complexity of Abduction. (1991)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT, Cambridge (2001). http://mitpress.mit.edu/catalog/item/default.asp?tid=8570\&\#38;ttype=2
Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM 42(1), 3–42 (1995)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)
Franceschetti, M., Cook, M., Bruck, J.: A geometric theorem for network design. IEEE Trans. Comput. 53(4), 483–489 (2004)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987). http://dx.doi.org/10.1145/28869.28874
Freedman, D., Purves, R., Pisani, R.: Statistics, 4 edn. W.W. Norton and Co., New York (2007)
Fu, B., Chen, Z., Abdelguerfi, M.: An almost linear time 2.8334-approximation algorithm for the disc covering problem. In: AAIM ’07: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management, pp. 317–326. Springer, Berlin (2007)
Gijsbrechts, E., Campo, K., Goossens, T.: The impact of store flyers on store traffic and store sales: a geo-marketing approach. J. Retailing 79(1), 1–16 (2003). http://www.sciencedirect.com/science/article/B6W5D-4893MB0-1/2/db6c17461f5e9d38b3856a6b742e5a7a
Gonzalez, T.F.: Covering a set of points in multidimensional space. Inf. Process. Lett. 40(4), 181–188 (1991)
Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. J. ACM 32, 130–136 (1985)
ISW: Map of Special Groups Activity in Iraq, Institute for the Study of War (2008)
doL̃agoP̃ereira, S., deB̃arros, L.N.: Planning with abduction: A logical framework to explore extensions to classical planning. In: Lecture Notes in Computer Science Advances in Artificial Intelligence – SBIA (2004)
Liao, C., Hu, S.: Polynomial time approximation schemes for minimum disk cover problems. J. Comb. Optim. http://dx.doi.org/10.1007/s10878-009-9216-y
MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Cam, L.M.L., Neyman, J. (eds.) Proceedings of the fifth Berkeley Symposium on Mathematical Statistics and Probability. vol. 1, pp. 281–297. University of California Press, Berkeley, CA (1967)
Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13(1), 182–196 (1984)
Nemhauser, G.L., Wolsey, L.A., Fisher, M.:
Paschos, V.T.: A survey of approximately optimal solutions to some covering and packing problems. ACM Comput. Surv. 29(2), 171–209 (1997)
Peirce, C.S.: In: Buchler, J. (ed.) Philosophical Writings of Peirce. Dover Publications, New York (1955)
Peng, Y., Reggia, J.A.: Abductive Inference Models for Diagnostic Problem-Solving. Springer, New York (1990)
Rich, T.H., Fenton, M.A., Fenton, C.L.: The fossil book: A record of prehistoric life, 2nd edn. Dover Publications, New York (1996)
Rossmo, D.K., Rombouts, S.: Geographic Profiling. In: Wortley, R., Mazerolle, L. (eds.) Enviromental Criminology and Crime Analysis, pp. 136–149. Willan, Portland, OR (2008)
Shakarian, P., Subrahmanian, V., Spaino, M.L.: SCARE: A Case Study with Baghdad. In: Proceedings of the Third International Conference on Computational Cultural Dynamics. AAAI (2009)
Shakarian, P., Subrahmanian, V., Spaino, M.L.: Gaps: Geospatial abduction problems. ACM Transactions on Intelligent Systems and Technology. (2011)
Stollsteimer, J.F.: A working model for plant numbers and locations. J. Farm. Econom. 45(3), 631–645 (1963)
US Army: Intelligence Preparation of the Battlefiled (US Army Field Manual), FM 34-130 edn. (1994)
Acknowledgements
Some of the authors of this paper were funded in part by AFOSR grant FA95500610405 and ARO grants W911NF0910206 and W911NF0910525.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag/Wien
About this chapter
Cite this chapter
Shakarian, P., Subrahmanian, V.S. (2011). Region-Based Geospatial Abduction with Counter-IED Applications. In: Wiil, U.K. (eds) Counterterrorism and Open Source Intelligence. Lecture Notes in Social Networks. Springer, Vienna. https://doi.org/10.1007/978-3-7091-0388-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-7091-0388-3_7
Published:
Publisher Name: Springer, Vienna
Print ISBN: 978-3-7091-0387-6
Online ISBN: 978-3-7091-0388-3
eBook Packages: Computer ScienceComputer Science (R0)