Computer Science – Information Theory
Scientific paper
2011-01-26
Computer Science
Information Theory
9 pages, 15 figures
Scientific paper
We investigate approximating joint distributions of random processes with causal dependence tree distributions. Such distributions are particularly useful in providing parsimonious representation when there exists causal dynamics among processes. By extending the results by Chow and Liu on dependence tree approximations, we show that the best causal dependence tree approximation is the one which maximizes the sum of directed informations on its edges, where best is defined in terms of minimizing the KL-divergence between the original and the approximate distribution. Moreover, we describe a low-complexity algorithm to efficiently pick this approximate distribution.
Coleman Todd P.
Kiyavash Negar
Quinn Christopher J.
No associations
LandOfFree
Causal Dependence Tree Approximations of Joint Distributions for Multiple Random Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Causal Dependence Tree Approximations of Joint Distributions for Multiple Random Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Causal Dependence Tree Approximations of Joint Distributions for Multiple Random Processes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-419600