THE REPRESENTATION POWER OF PROBABILISTIC KNOWLEDGE BY UNDIRECTED GRAPHS AND DIRECTED ACYCLIC GRAPHS - A COMPARISON

Authors
UR S PAZ A
Citation
S. Ur et A. Paz, THE REPRESENTATION POWER OF PROBABILISTIC KNOWLEDGE BY UNDIRECTED GRAPHS AND DIRECTED ACYCLIC GRAPHS - A COMPARISON, International journal of general systems, 22(2), 1994, pp. 219-231
Citations number
8
Categorie Soggetti
Ergonomics,"System Science","Computer Science Theory & Methods",Ergonomics
Journal title
International journal of general systems → ACNP
ISSN journal
03081079
Volume
22
Issue
2
Year of publication
1994
Pages
219 - 231
Database
ISI
SICI code
0308-1079(1994)22:2<219:TRPOPK>2.0.ZU;2-4
Abstract
Two modes of representation of probabilistic knowledge are considered: undirected graphs (UG's) and directed acyclic graphs (DAG's). It is s hown that there is a UG such that the knowledge represented in it requ ires exponentially many (in the number of vertices of the UG) DAG's fo r its representation and there is a DAG such that the knowledge repres ented in it requires exponentially many UG's for its representation. I t is thus shown that neither method can be preferred in all cases over the other.