A munin network for the median nerve-a case study on loops
Applied Artificial Intelligence
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Heuristic Algorithms for the Triangulation of Graphs
IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
Exploiting functional dependence in bayesian network inference
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
All roads lead to Rome---New search methods for the optimal triangulation problem
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where all conditional probability tables are noisy-or gates. In order to perform efficient inference, graphical transformations of these networks are performed. The efficiency of inference is proportional to the total table size of tables corresponding to the cliques of the triangulated graph. Therefore in order to get efficient inference it is desirable to have small cliques in the triangulated graph. We analyze existing heuristic triangulation methods applicable to BN2O networks after transformations using parent divorcing and tensor rank-one decomposition and suggest several modifications. Both theoretical and experimental results confirm that tensor rank-one decomposition yields better results than parent divorcing in randomly generated BN2O networks that we tested.