Directed evidential networks with conditional belief functions

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

Abstract

The main question addressed in this paper is how to represent belief functions independencies by graphical model. Directed evidential networks (DEVNs) with conditional belief functions are then proposed. These networks are directed acyclic graphs (DAGs) similar to Bayesian networks but instead of using probability functions, we use belief functions. Directed evidential network with conditional belief functions has the advantage of providing an appropriate representation of the knowledge that can be produced as conditional relationships.

Cite

CITATION STYLE

APA

Ben Yaghlane, B., Smets, P., & Mellouli, K. (2003). Directed evidential networks with conditional belief functions. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2711, pp. 291–305). https://doi.org/10.1007/978-3-540-45062-7_24

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