Title :
On construction of Markov tree in reasoning about uncertainty
Author :
Du Jingsong ; Xu Chuan
Author_Institution :
Dept. of Comput. Sci., Wuhan Univ., China
Abstract :
Preliminary results on the construction of a Markov tree in reasoning about uncertainty are presented in this paper. A Markov tree is one kind of special graphical model where a local computation scheme is feasible. It is shown that a maximum cardinality search algorithm on a hypergraph gives a construction of a Markov tree if the hypergraph is a hypertree. It is also shown that the transformation from an arbitrary hypergraph to minimal hypertree cover is NP-complete.<>
Keywords :
Markov processes; computational complexity; inference mechanisms; trees (mathematics); uncertainty handling; Markov tree; NP-complete transformation; graphical model; hypergraph; local computation scheme; maximum cardinality search algorithm; minimal hypertree cover; reasoning; uncertainty; Artificial intelligence; Distributed computing; Explosions; Fuzzy logic; Glands; Graphical models; Measurement uncertainty; Pervasive computing; State-space methods; Tree graphs;
Conference_Titel :
TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on
Conference_Location :
Beijing, China
Print_ISBN :
0-7803-1233-3
DOI :
10.1109/TENCON.1993.320085
