Complexity of Hierarchical Trees in Evidence Theory
ORSA Journal on Computing · 1994-02 · 6 (1) · 37-49
DOI: 10.1287/ijoc.6.1.37 ↗Kurz gefasst
Fachartikel in der Zeitschrift ORSA Journal on Computing, 1994-02. Verfasst von Vincent Dugat und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref).
Abstract (Originalsprache)
In this article we propose a structure called hierarchical tree to reduce the complexity of the Dempster's rule of combination in evidence theory. Our algorithm is bounded by O(2 2 n −2 ) in the worst case versus O(2 2 n ) for the brute-force algorithm. We can hope for a better average complexity. Furthermore, we propose algorithms based on hierarchical trees to reduce the complexity of the computation of Bel, Pl and Q functions. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Zitieren
APA
Dugat, V., & Sandri, S. (1994). Complexity of Hierarchical Trees in Evidence Theory. ORSA Journal on Computing, 6(1), 37-49. https://doi.org/10.1287/ijoc.6.1.37
Vancouver
Dugat V, Sandri S. Complexity of Hierarchical Trees in Evidence Theory. ORSA Journal on Computing. 1994;6(1):37-49. doi:10.1287/ijoc.6.1.37
BibTeX
@article{Dugat1994,
author = {Dugat, Vincent and Sandri, Sandra},
title = {Complexity of Hierarchical Trees in Evidence Theory},
journal = {ORSA Journal on Computing},
year = {1994},
volume = {6},
number = {1},
pages = {37--49},
doi = {10.1287/ijoc.6.1.37}
}
EUVIMED