Maximum likelihood fitting of acyclic directed mixed graphs to binary data
classification
📊 stat.ME
cs.AI
keywords
acyclicbinarydatadirectedfittinggraphslikelihoodmaximum
read the original abstract
Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present the first method for fitting these models to binary data using maximum likelihood estimation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.