Learning minimal latent directed information polytrees

DOI10.1162/NECO_A_00874zbMATH Open1474.68250OpenAlexW2464116876WikidataQ44497106 ScholiaQ44497106MaRDI QIDQ5380561FDOQ5380561

Authors: Jalal Etesami, Negar Kiyavash, Todd Coleman 

Publication date: 5 June 2019

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco_a_00874

Recommendations

• Learning latent tree graphical models
• A formal approach to using data distributions for building causal polytree structures
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• scientific article; zbMATH DE number 67622
• scientific article; zbMATH DE number 167417

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Cites Work

• The pricing of options and corporate liabilities
• Title not available (Why is that?)
• Graphical interaction models for multivariate time series.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating discrete probability distributions with dependence trees
• Probabilistic graphical models.
• ``Ideal parent structure learning for continuous variable Bayesian networks
• Title not available (Why is that?)
• Investigating Causal Relations by Econometric Models and Cross-spectral Methods
• Title not available (Why is that?)
• The complexity of reconstructing trees from qualitative characters and subtrees
• Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
• Granger causality and path diagrams for multivariate time series
• A linear non-Gaussian acyclic model for causal discovery
• Markov equivalence for ancestral graphs
• Measures of mutual and causal dependence between two time series (Corresp.)
• Estimating the directed information to infer causal relationships in ensemble neural spike train recordings
• Title not available (Why is that?)
• Learning latent tree graphical models
• A few logs suffice to build (almost) all trees. II
• On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• Pairwise likelihood ratios for estimation of non-Gaussian structural equation models
• Equivalence and Synthesis of Causal Models
• Directed Information Graphs
• Designing Router Scheduling Policies: A Privacy Perspective

Cited In (2)

• Learning latent tree graphical models
• Learning linear non-Gaussian causal models in the presence of latent variables

This page was built for publication: Learning minimal latent directed information polytrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380561)