Bounding Entries in Multi-way Contingency Tables Given a Set of Marginal Totals
Bounding Entries in Multi-way Contingency Tables Given a Set of Marginal Totals
复制标题
DOI:
10.1007/978-3-642-57410-8_1
复制
发表时间:
2003
期刊:
影响因子:
--
通讯作者:
A. Dobra;S. Fienberg
中科院分区:
文献类型:
--
作者:
A. Dobra;S. Fienberg
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.