Abstract
We consider swapping of two records in a microdata set for the purpose of disclosure control. We give some necessary and sufficient conditions that some observations can be swapped between two records under the restriction that a given set of marginals are fixed. We also give an algorithm to find another record for swapping if one wants to swap out some observations from a particular record.
Similar content being viewed by others
References
Aoki S, Takemura A (2003) Minimal basis for a connected Markov chain over 3 × 3 × K contingency tables with fixed two-dimensional marginals. Aust N Z J Stat 45(2):229–249. ISSN 1369–1473
Berry A, Bordat JP, Cogis O (2000) Generating all the minimal separators of a graph. Int J Found Comput Sci 11(3):397–403
Dalenius T, Reiss SP (1982) Data-swapping: a technique for disclosure control. J Stat Plan Inference 6(1):73–85 ISSN 0378-3758
Diaconis P, Sturmfels B (1998) Algebraic algorithms for sampling from conditional distributions. Ann Stat 26(1):363–397 ISSN 0090-5364
Dobra A (2003) Markov bases for decomposable graphical models. Bernoulli 9(6):1093–1108 ISSN 1350-7265
Dobra A, Sullivant S (2004) A divide-and-conquer algorithm for generating Markov bases of multi-way tables. Comput Stat 19(3):347–366 ISSN 0943-4062
Geiger D, Meek C, Sturmfels B (2006) On the toric algebra of graphical models. Ann Stat 34(3):1463–1492
Klain DA, Rota G-C (1997) Introduction to geometric probability. Lezioni Lincee. [Lincei Lectures]. Cambridge University Press, Cambridge, ISBN 0-521-59362-X; 0-521-59654-8
Kloks D, Kratsch D (1998) Listing all minimal separators of a graph. SIAM J Comput 27(3):605–613
Lauritzen SL (1996) Graphical models. Oxford University Press, Oxford
Schlörer J (1981) Security of statistical databases: multidimensional transformation. ACM Trans Database Syst 6(1):95–112 ISSN 0362-5915
Shiloach Y, Vishkin U (1982) An O(log n) parallel connectivity algorithm. J Algorithms 3:57–67
Takemura A (2002) Local recording and record swapping by maximum weight matching for disclosure control of microdata sets. J Off Stat 18(2):275–289
Takemura A, Endo Y (2006) Evaluation of per-record identification risk and swappability of records in a microdata set via decomposable models. arXiv:math.ST/0603609
Willenborg L, de Waal T (2001) Elements of statistical disclosure control. Lecture Notes in Statistics, vol 155. Springer, New York, ISBN 0-387-95121-0
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Takemura, A., Hara, H. Conditions for swappability of records in a microdata set when some marginals are fixed. Computational Statistics 22, 173–185 (2007). https://doi.org/10.1007/s00180-007-0024-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00180-007-0024-5