GAPs: Geospatial Abduction Problems
2010, ACM Transactions on …
Abstract
There are many applications where we observe various phenomena in space (e.g. locations of victims of a serial killer), and where we want to infer \partner" locations (e.g. the location where the killer lives) that are geospatially related to the observed phenomena. In this paper, we define geospatial abduction problems (GAPs for short). We analyze the complexity of GAPs, develop exact and approximate algorithms (often with approximation guarantees) for these problems together with analyses of these algorithms, and develop a prototype implementation of our GAP framework. We demonstrate accuracy of our algorithms on a real world data set consisting of insurgent IED (improvised explosive device) attacks against US forces in Iraq (the observations were the locations of the attacks, while the \partner" locations we were trying to infer were the locations of IED weapons caches).
References (35)
- Alpaydin, E. 2010. Introduction to Machine Learning, 2 ed. MIT Press.
- Basu, S., Davidson, I., and Wagstaff, K. 2008. Constrained Clustering: Advances in Algo- rithms, Theory, and Applications. Chapman & Hall/CRC.
- Brantingham, P. and Brantingham, P. 2008. Crime Pattern Theory. In Enviromental Crimi- nology and Crime Analysis, R. Wortley and L. Mazerolle, Eds. 78-93.
- Bylander, T., Allemang, D., Tanner, M. C., and Josephson, J. R. 1991. The computational complexity of abduction. Artificial Intelligence 49, 1-3, 25-60.
- Console, L., Portinale, L., and Theseider Dupré, D. Focussing Abductive Diagnosis. Arti- ficial Intelligence Communications, year=1991, volume = 4, number = 2-3, pages = 88-97 .
- Console, L., Sapino, M. L., and Theseider Dupré, D. 1995. The Role of Abduction in Database View Updating. J. Intelligent Information Systems 4, 3, 261.
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms, Second ed. MIT Press.
- Davidson, I. and Ravi, S. S. 2005. Clustering with constraints: Feasibility issues and the k-means algorithm. In SIAM Data Mining Conference (SDM).
- do Lago Pereira, S. and de Barros, L. N. 2004. Planning with abduction: A logical framework to explore extensions to classical planning. In Lecture Notes in Computer Science Advances in Artificial Intelligence.
- Eiter, T. and Gottlob, G. 1995. The complexity of logic-based abduction. Journal of the ACM 42, 1, 3-42.
- Fredman, M. L. and Tarjan, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. Journal ACM 34, 3 (July), 596-615.
- Freedman, D., Purves, R., and Pisani, R. 2007. Statistics, 4 ed. W.W. Norton and Co.
- Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA.
- Hochbaum, D. S. 1982. Approximation Algorithms for the Set Covering and Vertex Cover Problems. SIAM Journal on Computing 11, 3, 555-556.
- Jia, L., Rajaraman, R., and Suel, T. 2002. An efficient distributed algorithm for constructing small dominating sets. Distributed Computing 15, 4, 193-205.
- Johnson, D. 1982. The NP-Completeness Column: An Ongoing Guide. J. Algorithms 3, 2, 182-195.
- Kakas, A. C. and Mancarella, P. 1990. Database updates through abduction. In International Conference on Very Large Databases (VLDB).
- Karp, R. 1972. Reducibility Among Combinatorial Problems. In Complexity of Computer Com- putations, R. E. Miller and J. W. Thatcher, Eds. 85103.
- Kuhn, F. and Wattenhofer, R. 2003. Constant-time distributed dominating set approximation. In Proc. of the 22 nd ACM Symposium on the Principles of Distributed Computing (PODC). 25-32. • 29
- Kuipers, B. 1996. A hierarchy of qualitative representations for space. In Working papers of the Tenth International Workshop on Qualitative Reasoning about Physical Systems.
- Lu, J. J., Nerode, A., and Subrahmanian, V. 1996. Hybrid knowledge bases. IEEE Transactions on Knowledge and Data Engineering 8, 5, 773-785.
- Lund, C. and Yannakakis, M. 1994. On the hardness of approximating minimization problems. Journal of the ACM 41, 5, 960-981.
- Maass, W. 1986. On the complexity of nonconvex covering. SIAM Journal on Computing 15, 2, 453-467.
- MacQueen, J. B. 1967. Some methods for classification and analysis of multivariate observations. In Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability, L. M. L. Cam and J. Neyman, Eds. Vol. 1. University of California Press, 281-297.
- Pagnucco, M. 1996. The role of abductive reasoning within the process of belief revision. Ph.D. thesis, Basser Department of Computer Science, University of Sydney, Australia.
- Papadimitriou, C. H. 1981. Worst-Case and Probabilistic Analysis of a Geometric Location Problem. SIAM Journal on Computing 10, 3, 542-557.
- Paschos, V. T. 1997. A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surveys 29, 2, 171-209.
- Peirce, C. S. 1955. Philosophical writings of Peirce, selected and edited with an introd. by Justus Buchler. Dover Publications New York,.
- Peng, Y. and Reggia, J. A. 1986. Plausibility of Diagnostic Hypotheses. In Proceedings, 5th National Conference on AI (AAAI). 140-145.
- Reggia, J. A. and Peng, Y. 1990. Abductive inference models for diagnostic problem-solving. Springer-Verlag New York, Inc., New York, NY, USA.
- Rossmo, D. K. and Rombouts, S. 2008. Geographic Profiling. In Enviromental Criminology and Crime Analysis, R. Wortley and L. Mazerolle, Eds. 136-149.
- Santos, P. and Shanahan, M. 2002. Hypothesising object relations from image transitions. In Proc. European Conference on Artificial Intelligence (ECAI).
- Shakarian, P., Subrahmanian, V., and Sapino, M. L. 2009. SCARE: A Case Study with Baghdad. In Proceedings of the Third International Conference on Computational Cultural Dynamics (ICCCD). AAAI.
- Shanahan, M. 1996. Noise and the common sense informatic situation. In Proc. AAAI. 1098. US Army. 1994. Intelligence Preparation of the Battlefiled (US Army Field Manual), FM 34-130 ed. Vazirani, V. V. 2004. Approximation Algorithms. Springer.
- Wagstaff, K., Cardie, C., Rogers, S., and Schrödl, S. 2001. Constrained k-means clustering with background knowledge. In Proceedings of the Eighteenth International Conference on Machine Learning (ICML). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 577- 584. WEKA. 2009. WEKA 3 Data Mining, http://www.cs.waikato.ac.nz/ml/weka/.