Bounds for Cell Entries in Two-Way Tables Given Conditional Relative Frequencies

  • Aleksandra B. Slavkovic
  • Stephen E. Fienberg
Conference paper

DOI: 10.1007/978-3-540-25955-8_3

Volume 3050 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Slavkovic A.B., Fienberg S.E. (2004) Bounds for Cell Entries in Two-Way Tables Given Conditional Relative Frequencies. In: Domingo-Ferrer J., Torra V. (eds) Privacy in Statistical Databases. PSD 2004. Lecture Notes in Computer Science, vol 3050. Springer, Berlin, Heidelberg

Abstract

In recent work on statistical methods for confidentiality and disclosure limitation, Dobra and Fienberg (2000, 2003) and Dobra (2002) have generalized Bonferroni-Fréchet-Hoeffding bounds for cell entries in k-way contingency tables given marginal totals. In this paper, we consider extensions of their approach focused on upper and lower bounds for cell entries given arbitrary sets of marginals and conditionals. We give a complete characterization of the two-way table problem and discuss some implications to statistical disclosure limitation. In particular, we employ tools from computational algebra to describe the locus of all possible tables under the given constraints and discuss how this additional knowledge affects the disclosure.

Keywords

Confidentiality Contingency tables Integer programming Linear programming Markov bases Statistical disclosure control Tabular data 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Aleksandra B. Slavkovic
    • 1
  • Stephen E. Fienberg
    • 2
  1. 1.Department of StatisticsCarnegie Mellon UniversityPittsburghUSA
  2. 2.Department of Statistics, Center for Automated Learning and Discovery, Center for Computer Communications and SecurityCarnegie Mellon UniversityPittsburghUSA