A Java implementation of the probabilistic argumentation system for data fusion in missile defense applications

Moses W. Chan; Terri N. Hansen; Paul-Andre Monney; Todd L. Baker

doi:10.1117/12.541136

12 April 2004 A Java implementation of the probabilistic argumentation system for data fusion in missile defense applications

Moses W. Chan, Terri N. Hansen, Paul-Andre Monney, Todd L. Baker

Author Affiliations +

Proceedings Volume 5434, Multisensor, Multisource Information Fusion: Architectures, Algorithms, and Applications 2004; (2004) https://doi.org/10.1117/12.541136
Event: Defense and Security, 2004, Orlando, Florida, United States

Abstract

In missile defense target recognition applications, knowledge about the problem may be imperfect, imprecise, and incomplete. Consequently, complete probabilistic models are not available. In order to obtain robust inference results and avoid making inaccurate assumptions, the probabilistic argumentation system (PAS) is employed. In PAS, knowledge is encoded as logical rules with probabilistically weighted assumptions. These rules map directly to Dempster-Shafer belief functions, which allow for uncertainty reasoning in the absence of complete probabilistic models. The PAS can be used to compute arguments for and against hypotheses of interest, and numerical answers that quantify these arguments. These arguments can be used as explanations that describe how inference results are computed. This explanation facility can also be used to validate intelligent information, which can in turn improve inference results. This paper presents a Java implementation of the probabilistic argumentation system as well as a number of new features. A rule-based syntax is defined as a problem encoding mechanism and for Monte Carlo simulation purposes. In addition, a graphical user interface (GUI) is implemented so that users can encode the knowledge database, and visualize relationships among rules and probabilistically weighted assumptions. Furthermore, a graphical model is used to represent these rules, which in turn provides graphical explanations of the inference results. We provide examples that illustrate how classical pattern recognition problems can be solved using canonical rule sets, as well as examples that demonstrate how this new software can be used as an explanation facility that describes how the inference results are determined.

Citation Download Citation

Moses W. Chan, Terri N. Hansen, Paul-Andre Monney, and Todd L. Baker "A Java implementation of the probabilistic argumentation system for data fusion in missile defense applications", Proc. SPIE 5434, Multisensor, Multisource Information Fusion: Architectures, Algorithms, and Applications 2004, (12 April 2004); https://doi.org/10.1117/12.541136

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available