Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Using Tree-Decomposable Structures to Approximate Belief Networks   Tree structures have been shown to provide an efficient framework for
propagating beliefs [Pearl,1986]. This paper studies the problem of finding an
optimal approximating tree. The star decomposition scheme for sets of three
binary variables [Lazarsfeld,1966; Pearl,1986] is shown to enhance the class of
probability distributions that can support tree structures; such structures are
called tree-decomposable structures. The logarithm scoring rule is found to be
an appropriate optimality criterion to evaluate different tree-decomposable
structures. Characteristics of such structures closest to the actual belief
network are identified using the logarithm rule, and greedy and exact
techniques are developed to find the optimal approximation.

7
The categories of this paper are: hep-th
17
The categories of this paper are: q-fin
4
The categories of this paper are: cond-mat
10
The categories of this paper are: q-bio
12
The categories of this paper are: nucl-th
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
36
The categories of this paper are: cmp-lg
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
34
The categories of this paper are: chem-ph
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys
8
The categories of this paper are: hep-ex