Faithfulness and learning hypergraphs from discrete distributions

DOI10.1016/j.csda.2015.01.017zbMath1468.62103arXiv1404.6617OpenAlexW2031537979MaRDI QIDQ1663308

Anna Klimova, Tamás Rudas, Caroline Uhler

Publication date: 21 August 2018

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.6617

zbMATH Keywords

hypergraphscontingency tablesdirected acyclic graphshierarchical log-linear models(strong-)faithfulness

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Probabilistic graphical models (62H22)

Uses Software

• pcalg
• ElemStatLearn
• TETRAD
• MIM

Cites Work

• Geometry of the faithfulness assumption in causal inference
• Marginal models for categorical data
• A note on adding and deleting edges in hierarchical log-linear models
• Uniform consistency in causal inference
• Parameterization and estimation of path models for categorical data
• Analogies between Multiplicative Models in Contingency Tables and Covariance Selection
• Introduction to Graphical Modelling
• Measures of Association for Cross Classifications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Faithfulness and learning hypergraphs from discrete distributions