Skip to main content

Mining Association Rules from Distorted Data for Privacy Preservation

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3683))

Abstract

In order to improve privacy preservation and accuracy, we present a new association rule mining scheme based on data distortion. It consists of two steps: First, the original data are distorted by a new randomization method. Then, the mining algorithm is implemented to find frequent itemsets from the distorted data, and generate association rules. With reasonable selection for the random parameters, our scheme can simultaneously provide a higher privacy preserving level to the users and retain a higher accuracy in the mining results.

This work is supported by the National Natural Science Foundation of China under Grant No.60403041.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Verykios, V.S., Bertino, E., Fovino, I.N., Provenza, L.P., Saygin, Y., Theodoridis, Y.: State-of-the-art in Privacy Preserving Data Mining. SIGMOD Record 33(1) (2004)

    Google Scholar 

  2. Rizvi, S.J., Haritsa, J.R.: Maintaining Data Privacy in Association Rule Mining. In: Proceedings of the 28th International Conference on Very Large Data Bases (2002)

    Google Scholar 

  3. Agrawal, S., Krishnan, V., Haritsa, J.R.: On Addressing Efficiency Concerns in Privacy-Preserving Mining. In: Proceedings of the 9th International Conference on DASFAA (2004)

    Google Scholar 

  4. Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy Preserving Mining of Association Rules. In: Proc. of the 8th ACM SIGKDD International Conference on KDD (2002)

    Google Scholar 

  5. Saygin, Y., Verykios, V.S., Clifton, C.: Using Unknowns to Prevent Discovery of Association Rules. ACM SIGMOD Record 30(4) (2001)

    Google Scholar 

  6. Oliveira, S.R.M., Zaane, O.R.: Privacy Preserving Frequent Itemset Mining. In: Proceedings of the IEEE ICDM Workshop on Privacy, Security and Data Mining (2002)

    Google Scholar 

  7. Kantarcioglu, M., Clifton, C.: Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data. IEEE Transactions on Knowledge and Data Engineering 16(9) (2003)

    Google Scholar 

  8. Vaidya, J., Clifton, C.: Privacy Preserving Association Rule Mining in Vertically Partitioned Data. In: Proc. of the 8th ACM SIGKDD International Conference on KDD (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, P., Tong, Y., Tang, S., Yang, D. (2005). Mining Association Rules from Distorted Data for Privacy Preservation. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553939_187

Download citation

  • DOI: https://doi.org/10.1007/11553939_187

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28896-1

  • Online ISBN: 978-3-540-31990-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics