GAPs

Geospatial abduction problems

Paulo Shakarian, V. S. Subrahmanian, Maria Luisa Sapino

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 article, 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 U.S. 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).

Original languageEnglish (US)
Article number7
JournalACM Transactions on Intelligent Systems and Technology
Volume3
Issue number1
DOIs
StatePublished - Oct 2011
Externally publishedYes

Fingerprint

Abduction
Attack
Approximate Algorithm
Exact Algorithms
Cache
Prototype
Approximation
Demonstrate

Keywords

  • Abduction
  • Complexity analysis
  • Heuristic algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Artificial Intelligence

Cite this

GAPs : Geospatial abduction problems. / Shakarian, Paulo; Subrahmanian, V. S.; Sapino, Maria Luisa.

In: ACM Transactions on Intelligent Systems and Technology, Vol. 3, No. 1, 7, 10.2011.

Research output: Contribution to journalArticle

Shakarian, Paulo ; Subrahmanian, V. S. ; Sapino, Maria Luisa. / GAPs : Geospatial abduction problems. In: ACM Transactions on Intelligent Systems and Technology. 2011 ; Vol. 3, No. 1.
@article{172efd15e16b4530a518d8b6ef65c340,
title = "GAPs: Geospatial abduction problems",
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 article, 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 U.S. 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).",
keywords = "Abduction, Complexity analysis, Heuristic algorithms",
author = "Paulo Shakarian and Subrahmanian, {V. S.} and Sapino, {Maria Luisa}",
year = "2011",
month = "10",
doi = "10.1145/2036264.2036271",
language = "English (US)",
volume = "3",
journal = "ACM Transactions on Intelligent Systems and Technology",
issn = "2157-6904",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

T1 - GAPs

T2 - Geospatial abduction problems

AU - Shakarian, Paulo

AU - Subrahmanian, V. S.

AU - Sapino, Maria Luisa

PY - 2011/10

Y1 - 2011/10

N2 - 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 article, 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 U.S. 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).

AB - 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 article, 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 U.S. 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).

KW - Abduction

KW - Complexity analysis

KW - Heuristic algorithms

UR - http://www.scopus.com/inward/record.url?scp=80155151638&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80155151638&partnerID=8YFLogxK

U2 - 10.1145/2036264.2036271

DO - 10.1145/2036264.2036271

M3 - Article

VL - 3

JO - ACM Transactions on Intelligent Systems and Technology

JF - ACM Transactions on Intelligent Systems and Technology

SN - 2157-6904

IS - 1

M1 - 7

ER -