An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity
Jose M. Pea and Roland Nilsson and Johan Bjrkegren and Jesper Tegnr



Support
Academic Torrents!

Disable your
ad-blocker!

An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity.pdf190.69kB
Type: Paper
Tags:

Bibtex:
@article{10:38,author={Jose M. Pea and Roland Nilsson and Johan Bjrkegren and Jesper Tegnr}, Title={An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity},journal={Journal of Machine Learning Research},volume={10}, url={http://www.jmlr.org/papers/volume10/pena09a/pena09a.pdf}}