Abstract
Distributed association rule mining algorithms are used to discover important knowledge from databases. Privacy concerns can prevent parties from sharing the data. New algorithms are required to solve traditional mining problems without disclosing (original or derived) information of their own data to other parties. Research results have been developed on (i) incrementally maintaining the discovered association rules, and (ii) computing the distributed association rules while preserving privacy. However, no study has been conducted on the problem of the maintenance of the discovered rules with privacy protection when new sites join the old sites. We propose an algorithm SIMDAR for this problem. Some techniques we developed can even further reduce the cost in a normal association rule mining algorithm with privacy protection. Experimental results showed that SIMDAR can significantly reduce the workload at the old sites by up to 80%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB, Santiago, Chile (1994)
Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: SIGMOD, Dallas, Texas (2000)
IBM Almaden Research Center. Synthetic data generation code for association and sequential patterns
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: An incremental updating technique. In: ICDE, Washington, DC, USA (1996)
Cheung, D.W., Lee, S.D., Kao, B.: A general incremental technique for maintaining discovered association rules. In: Database Systems for advanced Applications, Melbourne, Australia (1997)
Cheung, D.W., Ng, V., Fu, A.W., Fu, Y.: Efficient mining of association rules in distributed databases. Special Issue in Data Mining, IEEE Transaction on Knowledge and Data Engineering 8(6) (December 1996)
Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.: Tools for privacy preserving distributed data mining. In: ACM SIGKDD Explorations Newsletter (2002)
Goldreich, O.: Foundations of Cryptography, May 2004, vol. 2. Weizmann Institute of Science, Israel (2004)
Ioannidis, I., Grama, A.: An efficient protocol for yao’s millionaires’ problem. In: HICSS, Waikoloa Village, Hawaii (2003)
Kantarcioğlu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowledge Data Eng. 16(4) (July 2004)
Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: KDD, Edmonton, Alberta, Canada (2002)
Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security 13(4) (November 2005)
Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Sciences (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wong, W.K., Cheung, D.W., Hung, E., Liu, H. (2008). Protecting Privacy in Incremental Maintenance for Distributed Association Rule Mining. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2008. Lecture Notes in Computer Science(), vol 5012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68125-0_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-68125-0_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68124-3
Online ISBN: 978-3-540-68125-0
eBook Packages: Computer ScienceComputer Science (R0)