Minimum Error Tree Decomposition

03/27/2013
by   L. Liu, et al.
0

This paper describes a generalization of previous methods for constructing tree-structured belief network with hidden variables. The major new feature of the described method is the ability to produce a tree decomposition even when there are errors in the correlation data among the input variables. This is an important extension of existing methods since the correlational coefficients usually cannot be measured with precision. The technique involves using a greedy search algorithm that locally minimizes an error function.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

research
03/06/2013

Using Tree-Decomposable Structures to Approximate Belief Networks

Tree structures have been shown to provide an efficient framework for pr...
research
03/27/2013

Optimal Decomposition of Belief Networks

In this paper, optimum decomposition of belief networks is discussed. So...
research
06/13/2011

Pitman-Yor Diffusion Trees

We introduce the Pitman Yor Diffusion Tree (PYDT) for hierarchical clust...
research
11/28/2017

Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set

An algorithm is presented that solves the Minimum Dominating Set problem...
research
09/02/2019

Computation Protein Design instances with small tree-width: selection based on coarse approximated 3D average position volume

This paper proposes small tree-width graph decomposition computational p...
research
02/07/2019

Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles

When analysing binary data, the ease at which one can interpret results ...
research
07/13/2018

Improved Methods for Making Inferences About Multiple Skipped Correlations

A skipped correlation has the advantage of dealing with outliers in a ma...

Please sign up or login with your details

Forgot password? Click here to reset