DIMACS Working Group on Data De-Identification, Combinatorial Optimization, Graph Theory,
and the Stat/OR Interface

November 9 - 10, 2004
DIMACS Center, CoRE Building, Rutgers University, Piscataway, New Jersey

Organizers:

Larry Cox, CDC, lcox@cdc.gov

Brenda Latka, DIMACS, latka@dimacs.rutgers.edu

Fred Roberts, DIMACS, froberts@dimacs.rutgers.edu

This is a subgroup meeting of the DIMACS Working Group on Privacy / Confidentiality of Health Data.

Background References

Some invitees have asked about general background reading on de-identification. None of the following references is a survey paper, but each introduces the overall de-identification problem in 2-dimensional tables mathematically, focuses on a subproblem of interest, and offers a mathematical model for solving the subproblem.

Controlled rounding:

• Cox, LH. and LR Ernst. Controlled rounding. INFOR 20, 1982, 423-432.

• Causey, BD, LH Cox and LR Ernst. Applications of transportation theory to statistical problems. Journal of the American Statistical Association 80, 1985, 903-909.

• Cox, LH. and JA George. Controlled rounding for tables with subtotals. Annals of Operations Research 20, 1989, 141-157.

Cell suppression:

• Gusfield, D. A graph theoretic approach to statistical data security. SIAM Journal on Computing 17, 552-571.

• Cox, LH. Network models for complementary cell suppression. Journal of the American Statistical Association 90, 1995, 1453-1462.

• Fischetti, M and JJ Salazar-Gonzalez. Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. Mathematical Programming 84, 1999, 283-312.

Previous: Participation

Workshop Index

DIMACS Homepage