Abstract
The issue of maintaining privacy in data mining has attracted considerable attention over the last few years. The difficulty lies in the fact that the two metrics for evaluating privacy preserving data mining methods: privacy and accuracy are typically contradictory in nature. This paper addresses privacy preserving mining of association rules on distributed dataset. We present an algorithm, based on a probabilistic approach of distorting transactions in the dataset, which can provide high privacy of individual information and at the same time acquire a high level of accuracy in the mining result. Finally, we present experiment results that validate the algorithm.
Supported by IBM SUR (SURTHU5).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Clifton, C., Marks, D.: Security and privacy implications of data mining. In: ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (May 1996)
Agrawal, R.: Data Mining: Crossing the Chasm. In: The 5th International Conference on Knowledge Discovery in Databases and Data Mining. August 1999, San Diego, California, an invited talk at SIGKDD (1999)
Agrawal, R., Srikant, R.: Privacy preserving data mining. In: Proc. of the ACM SIGMOD Conference on Management of Data, Dallas, Texas (May 2000)
Agrawal, D., Aggarwal, C.: On the Design and Quantification of Privacy Preserving Data Mining Algorithms. In: Proc. of 20th ACM Symp. on Principles of Database Systems (PODS) (2001)
Conway, R., Strip, D.: Selective partial access to a database. In: Proc. ACM Annual Conf. (1976)
Breiman, L., et al.: Classification and Regression Trees. Wadsworth, Belmont (1984)
Evfimievski, A., et al.: Privacy Preserving Mining of Association Rules. Information Systems 29(4), 343–364 (2004)
Rizvi, S.J., Haritsa, J.R.: Maintaining Data Privacy in Association Rule Mining. In: Proc. 28th International Conf. Very Large Data Bases (2002)
Agrawal, R., Shafer, J.C.: Parallel Mining of Association Rules: Design, Implementation, and Experience, in IBM Research Report (1996)
Cheung, D.W., et al.: Efficient mining of association rules in distributed databases. IEEE Transactions on Knowledge and Data Engineering 8(6), 911–922 (1996)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. IBM Almaden Research Center: San Jose, California (June 1994)
Adam, R., Wortman, J.C.: Security-control methods for statistical databases. ACM Computing Surveys 21(4), 515–556 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hui-zhang, S., Ji-di, Z., Zhong-zhi, Y. (2006). A Privacy Preserving Mining Algorithm on Distributed Dataset. In: Wang, L., Jiao, L., Shi, G., Li, X., Liu, J. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2006. Lecture Notes in Computer Science(), vol 4223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881599_80
Download citation
DOI: https://doi.org/10.1007/11881599_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45916-3
Online ISBN: 978-3-540-45917-0
eBook Packages: Computer ScienceComputer Science (R0)