Bounding Entries in Multi-way Contingency Tables Given a Set of Marginal Totals
Adrian Dobra, Stephen E. Fienberg · Contributions to statistics · 2003
We describe new results for sharp upper and lower bounds on the entries in multi-way tables of counts based on a set of released and possibly overlapping marginal tables. In particular, we present a generalized version of the shuttle algorithm proposed by Buzzigoli and Giusti that computes sharp integer bounds for an arbitrary set of fixed marginals. We also present two examples which illustrate the practical import of the bounds for assessing disclosure risk. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.