Bounds for cell entries in contingency tables given marginal totals and decomposable graphs

DOI10.1073/PNAS.97.22.11885zbMATH Open0960.62059OpenAlexW2086324413WikidataQ35343260 ScholiaQ35343260MaRDI QIDQ4528252FDOQ4528252

Authors: Adrian Dobra, Stephen E. Fienberg 

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

Recommendations

• Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
• Obtaining cell counts for contingency tables from rounded conditional frequencies
• Small Contingency Tables with Large Gaps
• scientific article; zbMATH DE number 2087727
• Generalized Fréchet Bounds for Cell Entries in Multidimensional Contingency Tables

zbMATH Keywords

reducible graphsloglinear modelsdisclosure limitationFrechet bounds

Mathematics Subject Classification ID

Applications of graph theory (05C90) Contingency tables (62H17) Connectivity (05C40)

Cites Work

• Decomposition by clique separators
• Optimal decomposition by clique separators
• Algorithms on clique separable graphs
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• Existence of probability measures with given marginals

Cited In (19)

• Generalized Fréchet Bounds for Cell Entries in Multidimensional Contingency Tables
• Racing trees to query partial data
• Experiments in stochastic computation for high-dimensional graphical models
• A generalisation of the aggregate association index (AAI): incorporating a linear transformation of the cells of a \(2 \times 2\) table
• The cost of using decomposable Gaussian graphical models for computational convenience
• An analytical approach to the inference of summary data of additive type
• Canonical and monophonic convexities in hypergraphs
• PRIVACY RISK ASSESSMENT WITH BOUNDS DEDUCED FROM BOUNDS
• Computing the integer programming gap
• A new mixed integer programming approach for inverse correspondence analysis
• Title not available (Why is that?)
• Re‐identification in the Absence of Common Variables for Matching
• Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
• A divide-and-conquer algorithm for generating Markov bases of multi-way tables
• Hierarchical subspace models for contingency tables
• The mode oriented stochastic search (MOSS) algorithm for log-linear models with conjugate priors
• Rough set-based feature selection for weakly labeled data
• A conjugate prior for discrete hierarchical log-linear models
• Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases

This page was built for publication: Bounds for cell entries in contingency tables given marginal totals and decomposable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4528252)