Small Contingency Tables with Large Gaps
نویسنده
چکیده
We construct examples of contingency tables on n binary random variables where the gap between the linear programming lower/upper bound and the true integer lower/upper bounds on cell entries is exponentially large. These examples provide evidence that linear programming may not be an effective heuristic for detecting disclosures when releasing margins of multi-way tables.
منابع مشابه
بررسی کمی زادآوری در حفره‌های ایجاد شده از اولین برش تک گزینی در شمشادستان مسکلی
In order to investigate the success of natural regeneration and to determine the best area for regeneration settlement, 12 gaps with the areas ranging from 50-100, 150-300, and 400-600 m2 and 4 replicates equal elevation level were selected. For measuring frequency, height, and collar diameter of regenerated seedlings, a certain number of 2 m2 subplots were carried out inside the gaps, along th...
متن کاملMeasures of association for contingency tables
The most general term for this type of measure is size of effect. Effect sizes allow us to make descriptive statements about samples. Traditionally, experimentalists have referred to ‘large’, ‘medium’ and ‘small’ effects, which is rather imprecise. Nonetheless, it is possible to employ statistically sound methods for comparing different sizes of effect by estimating a Gaussian confidence interv...
متن کاملبررسی کمی زادآوری در حفره‌های ایجاد شده از اولین برش تک گزینی در شمشادستان مسکلی
In order to investigate the success of natural regeneration and to determine the best area for regeneration settlement, 12 gaps with the areas ranging from 50-100, 150-300, and 400-600 m2 and 4 replicates equal elevation level were selected. For measuring frequency, height, and collar diameter of regenerated seedlings, a certain number of 2 m2 subplots were carried out inside the gaps, along th...
متن کاملOptimal Tabular Releases from Confidential Data
We describe and illustrate NISS-developed optimal tabular release technology, which releases sets of sub-tables of large contingency tables that maximize data utility (in our examples, the number of sub-tables released) subject to a constraint on disclosure risk (tightness of bounds on small-count, risky cells in the underlying table). This approach explicitly accommodates the mandate of Federa...
متن کاملAll Linear and Integer Programs Are Slim 3-Way Transportation Programs
We show that any rational convex polytope is polynomial-time representable as a three-way linesum transportation polytope of “slim” (r, c, 3) format. This universality theorem has important consequences for linear and integer programming and for confidential statistical data disclosure. We provide a polynomial-time embedding of arbitrary linear programs and integer programs in such slim transpo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 18 شماره
صفحات -
تاریخ انتشار 2005