Limit theorems for Dempster's rule of combination (Q1122203)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4105935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Limit theorems for Dempster's rule of combination |
scientific article; zbMATH DE number 4105935 |
Statements
Limit theorems for Dempster's rule of combination (English)
0 references
1988
0 references
The theory of Markov chains is used for the description of \textit{A. P. Dempster}'s rule [see Ann. Math. Stat. 38, 325-339 (1967; Zbl 0168.175)]. It is shown that each application of the rule corresponds to a transformation in a Markov chain. This representation is applied to the proof of a limit theorem concerning the long term effect of updating belief functions in Dempster's rule. The proposed approach may be useful for other considerations in Dempster's theory of evidence.
0 references
updating belief functions
0 references
Dempster's theory of evidence
0 references
0.90310395
0 references
0 references
0.8812729
0 references
0.8715238
0 references
0.86758846
0 references
0.8566988
0 references
0.8520754
0 references
