Skip to main content

Disclosure Limitation Problem and Markov Basis

  • Chapter
  • First Online:
Markov Bases in Algebraic Statistics

Part of the book series: Springer Series in Statistics ((SSS,volume 199))

  • 2227 Accesses

Abstract

In statistical disclosure control of microdata sets, swapping of observations among records is one of the convenient techniques for protecting risky records. When all variables of a microdata set are categorized, the data set is equivalent to a contingency table and swapping among k records is equivalent to adding or subtracting a degree k move. However swapping is not always available for all risky record. In this chapter we study swapping among two records and discuss the relation between swapping and Markov basis. We also give a necessary and sufficient condition for swappability of given two records.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  MathSciNet  Google Scholar 

  2. Dalenius, T., Reiss, S.P.: Data-swapping: A technique for disclosure control. J. Statist. Plann. Infer. 6(1), 73–85 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kloks, D., Kratsch, D.: Listing all minimal separators of a graph. SIAM J. Comput. 27(3), 605–613 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Schlörer, J.: Security of statistical databases: multidimensional transformation. ACM Trans. Database Syst. 6(1), 95–112 (1981)

    Article  MATH  Google Scholar 

  5. Shiloach, Y., Vishkin, U.: An O(logn) parallel connectivity algorithm. J. Algorithms 3, 57–67 (1975)

    Article  MathSciNet  Google Scholar 

  6. Takemura, A.: Local recording and record swapping by maximum weight matching for disclosure control of microdata sets. J. Offic. Stat. 18(2), 275–289 (2002)

    Google Scholar 

  7. Takemura, A., Hara, H.: Conditions for swappability of records in a microdata set when some marginals are fixed. Comput. Stat. 22, 173–185 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media New York

About this chapter

Cite this chapter

Aoki, S., Hara, H., Takemura, A. (2012). Disclosure Limitation Problem and Markov Basis. In: Markov Bases in Algebraic Statistics. Springer Series in Statistics, vol 199. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3719-2_14

Download citation

Publish with us

Policies and ethics