.png){kind=icon}
返回
GAPs: Geospatial Abduction Problems
.png){kind=icon}
OA
AI
DOI：10.1145/2036264.2036271.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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).
Keyword:
Theory
Algorithms
Experimentation
Abduction
complexity analysis
heuristic algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.5K
被引数:
6.2K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容