𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Alternative form of Dempster's rule for binary variables

✍ Scribed by Rajendra P. Srivastava

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
294 KB
Volume
20
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

✦ Synopsis

This article develops an alternative form of Dempster's rule of combination for binary variables. This alternative form does not only provide a closed form formula for efficient computation but also enables researchers to develop closed form analytical formulas for assessing risks such as information security risk, fraud risk, audit risk, independence risk, and so on involved in assurance services. We demonstrate the usefulness of the alternative form in calculating the overall information security risk and also in developing an analytical model for assessing fraud risk.

πŸ“œ SIMILAR VOLUMES

Nearest Neighbor Classification Rule for
Nearest Neighbor Classification Rule for Mixtures of Discrete and Continuous Random Variables
✍ T. J. Wojciechowski πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 297 KB πŸ‘ 2 views

In this paper very simple nonparametric c l d i c a t i o n rule for mixtures of discrete and oonhuons random variables is described. It ie based on the method of neatest neighbor proposed by COVEB and HABT (1967). The bounds on the limit of the near& neighbor ruleriske are given. Both lower and upp

On random orderings of variables for par
On random orderings of variables for parity ordered binary decision diagrams
✍ Petr SavickΓ½ πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 93 KB

## Ordered binary decision diagrams (OBDDs) are a model for representing Boolean functions. There is also a more powerful variant called parity OBDDs. The size of the representation of a given function depends in both these models on the chosen ordering of the variables. It is known that there are