Geospatial Abduction: Principles and Practice
Springer Science & Business Media, Oct 20, 2011 - Computers - 168 pages
Imagine yourself as a military officer in a conflict zone trying to identify locations of weapons caches supporting road-side bomb attacks on your country’s troops. Or imagine yourself as a public health expert trying to identify the location of contaminated water that is causing diarrheal diseases in a local population. Geospatial abduction is a new technique introduced by the authors that allows such problems to be solved. Geospatial Abduction provides the mathematics underlying geospatial abduction and the algorithms to solve them in practice; it has wide applicability and can be used by practitioners and researchers in many different fields. Real-world applications of geospatial abduction to military problems are included. Compelling examples drawn from other domains as diverse as criminology, epidemiology and archaeology are covered as well. This book also includes access to a dedicated website on geospatial abduction hosted by University of Maryland. Geospatial Abduction targets practitioners working in general AI, game theory, linear programming, data mining, machine learning, and more. Those working in the fields of computer science, mathematics, geoinformation, geological and biological science will also find this book valuable.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Abductive Inference Abductive Reasoning actual cache adversary’s Afghanistan agent’s strategy algorithm application Approximation Algorithms approximation ratio attacks Baghdad burglar cache locations cache sites cardinality chapter CLAIM complexity compute consider consti constraints contradiction core explanation cover cutoff distance define Definition density dist dominating set element Example expected adversarial detriment expected agent benefit explanation function distribution Explanation Problem Fibonacci heap Figure geospatial abduction problems greedy greedy algorithm GREEDY-KSEP-OPT1 GREEDY-MC2 grid spacing Hence HVTs improvised explosive device INPUT instance insurgents integer integer linear program iteration k-SEP k-sized simple linear MCA-GREEDY-MONO MCA-LS MILP monotonic NAIVE-KSEP-SC NP-Complete NP-hard number of regions optimal adversarial strategy OUTPUT p-values points polynomial Proof Proposition real numbers reduced REGION-GEN result returns reward function Sadr City SCARE SCARE-S2 set of observations set-cover Shakarian solution solve Springer Science+Business Media sub-explains submodular Subrahmanian subset Suppose Theorem tiger kills tion weapons caches