Quick search
Go!

ESSENTIAL GRAPH AS VERY EFFICIENT TOOLS


GARRIDO ANGEL
FACULTAD DE CIENCIAS UNED, MADRID, E-MAIL: AGARRIDO@MAT.UNED.ES

Issue:

MOCM, Number 14, Volume III

Section:

Issue No. 14 - Volume III (2008)

Abstract:

Bayesian Nets (BNs, in abridged expression) represent joint probability distributions (JPDs). We says that two BNs are equivalent (denoted by C), if both represent the same JPD. Now, we can see some useful characterizations of the equivalence among BNs, and the usefulness of Essential Graphs (EGs) as representatives of equivalence classes of BNs, in AI; for instance, learning BNs.

Keywords:

A, I, , Knowledge Representation, Graph Theory, Bayesian Nets.

Code [ID]:

MOCM200814V03S01A0009 [0002262]


Copyright (c) 1995-2007 University of Bacău