Discovering a junction tree behind a Markov network by a greedy algorithm

Tamas Szantai, Edith Kovacs

In an earlier paper we introduced a special kind of k-width junction tree, called k-th order t-cherry junction tree in order to approximate a joint probability distribution. The ap…