𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence of causal influence and clique tree propagation

✍ Scribed by Nevin Lianwen Zhang; Li Yan

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
716 KB
Volume
19
Category
Article
ISSN
0888-613X

No coin nor oath required. For personal study only.

✦ Synopsis

This paper explores the role of independence of causal influence (ICI) in Bayesian network inference. ICI allows one to factorize a conditional probability table into smaller pieces. We describe a method for exploiting the factorization in clique tree propagation (CTP) -the state-of-the-art exact inference algorithm for Bayesian networks (BNS). We also present empirical results showing that the resulting algorithm is significantly more efficient than the combination of CTP and previous techniques for exploiting ICI.

πŸ“œ SIMILAR VOLUMES

Clique polynomials and independent set p
Clique polynomials and independent set polynomials of graphs
✍ Cornelis Hoede; Xueliang Li πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 492 KB

This paper introduces two kinds of graph polynomials, clique polynomial and independent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned.

Metric characterizations of proper inter
Metric characterizations of proper interval graphs and tree-clique graphs
✍ Gutierrez, M.; OubiοΏ½a, L. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 393 KB πŸ‘ 2 views

A connected graph G is a tree-clique graph if there exists a spanning tree T (a compatible tree) such that every clique of G is a subtree of T. When Tis a path the connected graph G is a proper interval graph which is usually defined as intersection graph of a family of closed intervals of the real

Partitions of graphs into one or two ind
Partitions of graphs into one or two independent sets and cliques
✍ Andreas BrandstΓ€dt πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 417 KB

It is shown in this note that it can be recognized in polynomial time whether the vertex set of a finite undirected graph can be partitioned into one or two independent sets and one or two cliques. Such graphs generalize bipartite and split graphs and the result also shows that it can be recognized