Structured Methods for Intelligence Analysis

My colleagues just published a paper in Euro Journal on Decision Processes, for their special issue on risk management.

Karvetski, C.W, Olson, K.C., Gantz, D.T., Cross, G.A., "Structuring and analyzing competing hypotheses with Bayesian networks for intelligence analysis". EURO Journal on Decision Processes, Special Issue on Risk Management: http://link.springer.com/article/10.1007/s40070-013-0001-x

Alas, it's behind a paywall and the printed edition isn't due until Autumn. Here's an excerpt from the abstract:

Although ACH aims at reducing confirmation bias, as typically implemented, it can fall short in diagramming the relationships between hypotheses and items of evidence, determining where assumptions fit into the modeling framework, and providing a suitable model for ‘‘what-if’’ sensitivity analysis. This paper describes a facilitated process that uses Bayesian networks to (1) provide a clear probabilistic characterization of the uncertainty associated with competing hypotheses, and (2) prioritize information gathering among the remaining unknowns. We illustrate the process using the 1984 Rajneeshee bioterror attack in The Dalles, Oregon, USA.

I've seen some very good demonstrations of ACH, but when all is said and done, the ACH matrix is a rough approximation to Bayes, justified because it is faster or more intuitive.  But in fact it requires just as many judgments.  Consider this passage from their conclusion:

Although a Bayesian network is a more sophisticated model than ACH, it can be less tedious by eliminating repeated elicitations after partitioning hypotheses into multiple dimensions and focusing on local relationships between variables. With ACH, 121 inputs were needed to define the model in Table 2, whereas 118 conditional probabilities were needed in Tables 3 and 4 to define the Bayesian network.

And when you're done, the Bayes net can perform instantaneous what-if calculations, and update probabilities as evidence becomes available.  (And should you happen to have a combinatorial prediction market, you can crowdsource the probabilities in a distributed fashion.  But that's our other research project.)

The paper sets out a hypothetical analysis (with a real historical case).  Data collection is ongoing.   Their facilitated method has been tried on two groups of analysts and recently on a large (>100) group of students, all with good success.

Don Ferguson has sparked recent listserv discussion on scenario analysis and structured analytic techniques.  I think ACH is pretty good at what it does, and I think it's usually better than informal analysis.  But I think SAR planning would do better to make any structured scenario analysis fully Bayesian.  That's been a part of formal search theory since at least ~1970.

 

Posted in Search Theory | Tagged , , , , , , , , | Leave a comment

Thanks to Mike Goodrich for this RCMP Drone story.  In short, the RCMP spotted a stranded driver by using a drone-mounted infrared camera.

We hope the FAA soon settles on good regulations for such drone use in the US.

Posted on by ctwardy | Leave a comment

OSARA Talks Online

The Ohio SAR Association conference has posted their 2013 talks online.

Note particularly:

Ken Chiacchia's talk

Ken Chiacchia's talk, "ESW in the Alleghenies,"  includes our most recent AMDR work, and much more.  For example, he describes how to measure sweep width for a dog team.  The key idea is treating the dog-handler team as the sensor.

Detection by a Dog-Handler Team

Detection by a Dog-Handler Team (Chiacchia)

Ken also compared time to reach a coverage of 2 (or 86% POD) of a dog team and a human team, in some conditions:

Time-to-Coverage for a dog-handler team vs a two-human team. (Chiacchia)

Time-to-Coverage for a dog-handler team vs a two-human team. (Chiacchia)

Use the dogs where they give the biggest gain: here, full foliage, low-vis.  There is no useful gain in the high-vis leafless condition.

Also make sure to see his work on the effect of convection on sweep width (for some conditions).  Ken is doing the best work I know of on sweep width for dogs.  I look forward to the paper.

 

Posted in Search Theory | Tagged , , , | Leave a comment

"Small Scatters of Generally Unobtrusive Artifacts"

When searching for an image for this post, I came across several works by E.B. Banning applying search theory to archaeology:

  • Sweep widths and the detection of artifacts in archaeological survey. (2011) [Science Direct]
  • Detection functions for archaeological survey (2006). [JSTOR]
  • Archaeological Survey (2002 book). [Google books]

Now what would archaeologists be doing with sweep widths?  Looking for nails, shards, and other small objects in the soil.  What they nicely call "small scatters of generally unobtrusive artifacts on the surface".

In WiSAR we call them clues.

Continue reading

Posted in Search Theory | Tagged , , , , | Leave a comment

The nonsense math effect

An abstract just crossed my desk that I'd love to share.  Briefly, adding meaningless math to your academic paper inordinately impresses humanities PhDs.  The author does not say whether this also works in pickup lines, so there's room for follow-on research.

Continue reading

Posted in Links | Tagged , | Leave a comment

Just a quick note to highlight Paul Doherty's new research page.  It includes:

  • Overview of his research
  • Publications list
  • Software & Datasets page, including links to MapSAR and discussion groups.
  • Linkspage with a SAR & GIS bibliography including the memorably titled
    • Heggie, Travis W, and Michael E Amundson. 2009. “Dead Men Walking: Search and Rescue in US National Parks.” Wilderness & Environmental Medicine.
    • And the humorously mangled:  Is, Information, Releasable To, and Foreign Nationals. “Search and Rescue Optimal Planning System ( SAROPS ).” Training 2.
    • And three articles it sounds like I should read soon:
      • Jobe, T.R., and P.S. White. 2009. “A New Cost-distance Model for Human Accessibility and an Evaluation of Accessibility Bias in Permanent Vegetation Plots in Great Smoky Mountains National Park , USA.” Journal of Vegetation Science: 1099–1109.
      • Miller, Harvey J., and Scott a. Bridwell. 2009. “A Field-Based Theory for Time Geography.” Annals of the Association of American Geographers 99 (1) (January 8): 49–75. link
      • Pingel, Thomas J. 2011. “Estimating an Empirical Hiking Function from GPS Data.” Sports Medicine: 1–3.

At Mason we're collaborating with Paul to test a Watershed-Distance model developed by his research group.  Based on 58 tests run so far by Elena Sava on MapScore, this simple model scores 0.55.  Not bad for a model that doesn't yet discriminate by category (or any other feature).  Elena just finished a multivariate model combining Watersheds with the more usual crows'-flight distance, and we will begin testing that soon.

 

Posted on by ctwardy | Leave a comment

A Brief Intro to Search Theory (2 of 4)

In the previous post, we began to build a theory of detection over time as the result of a very large number of independent glimpses.  By assuming the environment to be fixed for awhile, we moved all the environmental factors into a constant (to be measured and tabulated), and simplified the function so it depended only on the range to the target.

In this post we simplify still further, introducing lateral range curves and the sweep width (also known as effective sweep width).  We will follow Washburn's Search & Detection, Chapter 2.  (So there's nothing new in this post. Just hopefully a clear and accessible presentation.)

Continue reading

Posted in Search Theory | Tagged , , , , , | 3 Comments

Brief Intro to SAR Theory (1 of 4)

We begin a four-part gentle introduction to search theory. Our topic is visual detection of targets by land searchers. Today we summarize Koopman Chapter 3, constructing the useful "inverse cube" detection model by starting from instantaneous glimpses with tiny detection probabilities.

Continue reading

Posted in Search Theory | Tagged , , , | 3 Comments

MapScore: A Portal for Scoring Probability Maps

The SARBayes MapScore server has been running for a month now at http://mapscore.sarbayes.org.  It's a portal for scoring probability maps, so researchers like us can measure how well we are doing, and see which approaches work best for which situations.  Take a look.  (And if you have a model, register and start testing it!)

Continue reading

Posted in MapScore: A Portal for Scoring Probability Maps | Tagged , , , , | 1 Comment

MapSAR

Don Ferguson just sent me an update on the MapSAR project -- he's presenting at a project meeting this week in the Grand Canyon.  I'm blown away by his slides.  They've got it: a GIS enabled search planning tool with a foundation in search theory. They've even got tools for various kinds of probability maps, and POD models.  I'd only been following this peripherally.  That has to change.  I've just signed up for the various groups and can't wait to test the software.

Continue reading

Posted in Search Theory | Tagged , , , | 1 Comment