Learning Link-Probabilities in Causal Trees

03/27/2013
by   Igor Roizer, et al.
0

A learning algorithm is presented which given the structure of a causal tree, will estimate its link probabilities by sequential measurements on the leaves only. Internal nodes of the tree represent conceptual (hidden) variables inaccessible to observation. The method described is incremental, local, efficient, and remains robust to measurement imprecisions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2013

Structuring Causal Tree Models with Continuous Variables

This paper considers the problem of invoking auxiliary, unobservable var...
research
03/27/2013

The Recovery of Causal Poly-Trees from Statistical Data

Poly-trees are singly connected causal networks in which variables may a...
research
09/23/2022

Sequential Causal Effect Variational Autoencoder: Time Series Causal Link Estimation under Hidden Confounding

Estimating causal effects from observational data in the presence of lat...
research
03/27/2013

Computation of Variances in Causal Networks

The causal (belief) network is a well-known graphical structure for repr...
research
01/15/2014

The Ultrametric Constraint and its Application to Phylogenetics

A phylogenetic tree shows the evolutionary relationships among species. ...
research
06/17/2016

Adding Context to Concept Trees

Concept Trees are a type of database that can organise arbitrary textual...

Please sign up or login with your details

Forgot password? Click here to reset