A note on adding and deleting edges in hierarchical log-linear models

DOI10.1007/s00180-011-0287-8zbMath1304.65027OpenAlexW2102152760MaRDI QIDQ2512761

David Edwards

Publication date: 30 January 2015

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-011-0287-8

zbMATH Keywords

dual representationhypergraph transversalgraphical log-linear model

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Related Items (1)

Faithfulness and learning hypergraphs from discrete distributions

Cites Work

• Algorithmic graph theory and perfect graphs
• Algorithm AS 247: Updating the Sufficient Configurations for Fitting ZPA Models to Multidimensional Contingency Tables
• A fast procedure for model search in multidimensional contingency tables
• A Fast Model Selection Procedure for Large Families of Models
• Identifying the Minimal Transversals of a Hypergraph and Related Problems

This page was built for publication: A note on adding and deleting edges in hierarchical log-linear models