Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
From MaRDI portal
Publication:4528252
DOI10.1073/pnas.97.22.11885zbMath0960.62059OpenAlexW2086324413WikidataQ35343260 ScholiaQ35343260MaRDI QIDQ4528252
Stephen E. Fienberg, Adrian Dobra
Publication date: 31 January 2001
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.97.22.11885
Related Items
Experiments in stochastic computation for high-dimensional graphical models, Re‐identification in the Absence of Common Variables for Matching, A new mixed integer programming approach for inverse correspondence analysis, Hierarchical subspace models for contingency tables, An analytical approach to the inference of summary data of additive type, Computing the integer programming gap, Rough set-based feature selection for weakly labeled data, The cost of using decomposable Gaussian graphical models for computational convenience, The mode oriented stochastic search (MOSS) algorithm for log-linear models with conjugate priors, A divide-and-conquer algorithm for generating Markov bases of multi-way tables, PRIVACY RISK ASSESSMENT WITH BOUNDS DEDUCED FROM BOUNDS, A conjugate prior for discrete hierarchical log-linear models, Canonical and monophonic convexities in hypergraphs, Racing trees to query partial data, Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
Cites Work
