Learning parameters in directed evidential networks with conditional belief functions

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Directed evidential networks with conditional belief functions are one of the most commonly used graphical models for analyzing complex systems and handling different types of uncertainty. A crucial step to benefit from the reasoning process in these models is to quantify them. So, we address, in this paper, the issue of estimating parameters in evidential networks from evidential databases, by applying the maximum likelihood estimation generalized to the evidence theory framework.

Cite

CITATION STYLE

APA

Hariz, N. B., & Yaghlane, B. B. (2014). Learning parameters in directed evidential networks with conditional belief functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8764, 294–303. https://doi.org/10.1007/978-3-319-11191-9_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free