Skip to main content
Log in

Conditions for swappability of records in a microdata set when some marginals are fixed

  • Original Paper
  • Published:
Computational Statistics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

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

    Article  MATH  MathSciNet  Google Scholar 

  • Berry A, Bordat JP, Cogis O (2000) Generating all the minimal separators of a graph. Int J Found Comput Sci 11(3):397–403

    Article  MathSciNet  Google Scholar 

  • Dalenius T, Reiss SP (1982) Data-swapping: a technique for disclosure control. J Stat Plan Inference 6(1):73–85 ISSN 0378-3758

    Article  MATH  MathSciNet  Google Scholar 

  • Diaconis P, Sturmfels B (1998) Algebraic algorithms for sampling from conditional distributions. Ann Stat 26(1):363–397 ISSN 0090-5364

    Article  MATH  MathSciNet  Google Scholar 

  • Dobra A (2003) Markov bases for decomposable graphical models. Bernoulli 9(6):1093–1108 ISSN 1350-7265

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    MATH  MathSciNet  Google Scholar 

  • Geiger D, Meek C, Sturmfels B (2006) On the toric algebra of graphical models. Ann Stat 34(3):1463–1492

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  MathSciNet  Google Scholar 

  • Lauritzen SL (1996) Graphical models. Oxford University Press, Oxford

    Google Scholar 

  • Schlörer J (1981) Security of statistical databases: multidimensional transformation. ACM Trans Database Syst 6(1):95–112 ISSN 0362-5915

    Article  MATH  Google Scholar 

  • Shiloach Y, Vishkin U (1982) An O(log n) parallel connectivity algorithm. J Algorithms 3:57–67

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Google Scholar 

  • 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

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Akimichi Takemura.

Rights and permissions

Reprints 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

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00180-007-0024-5

Keywords

Navigation