Preserving confidentiality of high-dimensional tabulated data: Statistical and computational issues

Statistics and Computing

Volumn 13, Issue 4, 2003, Pages 363-370

  Dobra, Adrian ^a,b   Karr, Alan F ^a   Sanil, Ashish P ^a  

^a NATIONAL INSTITUTE OF ENVIRONMENTAL HEALTH SCIENCES   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

Branch and bound; Contingency tables; Disclosure limitation; Integer programming; Marginal bounds; Shuttle algorithm

Indexed keywords

EID: 0347432366     PISSN: 09603174     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025671023941     Document Type: Article

References (18)

1. Bishop Y.M.M., Fienberg S.E., and Holland P.W. 1975. Discrete Multivariate Analyses: Theory and Practice. MIT Press, Cambridge, MA.
2. Buzzigoli L. and Giusti A. 1999. An algorithm to calculate the lower and upper bounds of the elements of an array given its marginals. In: Statistical Data Protection (SDP'98) Proceedings, Luxembourg, Eurostat. pp. 131-147.
3. Cormen T.H., Leiserson C.E., and Rivest R.L. 1990. Introduction to Algorithms. MIT Press/McGraw-Hill.
4. Dobra A. 2002. Statistical Tools for Disclosure Limitation in Multiway Contingency Tables. PhD thesis, Department of Statistics, Carnegie Mellon University.
5. Dobra A. and Fienberg S. E. 2000. Bounds for cell entries in contingency tables given marginal totals and decomposable graphs. Proc. Nat. Acad. Sciences 97: 11885-11892.
6. Dobra A. and Fienberg S.E. 2001. Bounds for cell entries in contingency tables induced by fixed marginal totals with applications to disclosure limitation. Statist. J. United Nations ECE 18:363-371, 2001. Presented at the 2nd Joint ECE/Eurostat Work Session on Statistical Data Confidentiality, 14-16 March, Skopje, Macedonia.
7. Dobra A. and Fienberg S.E. 2001. Bounds for cell entries in contingency tables induced by fixed marginal totals with applications to disclosure limitation. Statist. J. United Nations ECE 18:363-371, 2001. Presented at the 2nd Joint ECE/Eurostat Work Session on Statistical Data Confidentiality, 14-16 March, Skopje, Macedonia.
8. Dobra A., Karr A.F., Fienberg S.E., and Sanil A.P. 2002. Software systems for tabular data releases. Int. J. Uncertainty, Fuzziness and Knowledge Based Systems 10(5): 529-544.
9. Fienberg S.E. 1999. Fréchet and bonferroni bounds for multi-way tables of counts with applications to dis-closure limitation. In: Statistical Data Protection (SDP'98) Proceedings, Luxembourg, Eurostat. pp. 115-129.
10. Harinarayan V., Rajaraman A., and Ullman, J.D. 1996. Implementing data cubes efficiently. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Vol. 25(2) of ACM SIGMOD Record, June 4-6, ACM Press, New York, pp. 205-216.
11. Karr A.F., Dobra A., and Sanil A.P. 2003. Table servers protect confidentiality in tabular data releases. Comm. ACM 46(1): 57-58.
12. Knuth D.E. 1997. Fundamental Algorithms, Vol. 1 of The Art of Computer Programming, 3rd edn. Addison-Wesley, Reading, Massachusetts.
13. Lauritzen S.L. 1996. Graphical Models. Clarendon Press, Oxford, UK.
14. Madigan D. and York J. 1995. Bayesian graphical models for discrete data. Internat. Statis. Rev. 63: 215-232.
15. Moore A.W. and Lee M.S. 1998. Cached sufficient statistics for efficient machine learning with large datasets. J. Artificial Intell. Res. 8: 67-91.
16. Bjarne Stroustrup. 1997. The C++ Programming Language, 3rd edn. Addison-Wesley, Reading, MA.
17. Sun Microsystems. Java programming language. http://java.sun.com, 2002.
18. Willenborg L.C.R.J. and de Waal T. 2001. Elements of Statistical Disclosure Control. Springer-Verlag, New York.