Skip to main content

Privacy Preserving Mining of Global Association Rules on Distributed Dataset

  • Conference paper
Intelligence and Security Informatics (ISI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3975))

Included in the following conference series:

  • 1904 Accesses

Abstract

The issue of maintaining privacy in data mining has attracted considerable attention over the last few years. In this paper, we continue the investigation of the techniques of distorting data in developing data mining techniques without compromising customer privacy and present a privacy preserving data mining algorithm for finding frequent itemsets and mining association rules on distributed data allocated at different sites. Experimental results show that such a distortion approach can provide high privacy of individual information and at the same time acquire a high level of accuracy in the mining result.

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

Access this chapter

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shen, H., Zhao, J., Yao, R. (2006). Privacy Preserving Mining of Global Association Rules on Distributed Dataset. In: Mehrotra, S., Zeng, D.D., Chen, H., Thuraisingham, B., Wang, FY. (eds) Intelligence and Security Informatics. ISI 2006. Lecture Notes in Computer Science, vol 3975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760146_76

Download citation

  • DOI: https://doi.org/10.1007/11760146_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34478-0

  • Online ISBN: 978-3-540-34479-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics