Abstract
Data mining is a process that analyzes voluminous digital data in order to discover hidden but useful patterns from digital data. However, discovery of such hidden patterns has statistical meaning and may often disclose some sensitive information. As a result privacy becomes one of the prime concerns in data mining research community. Since distributed association mining discovers global association rules by combining local models from various distributed sites, breaching data privacy happens more often than it does in centralized environments. In this work we present a methodology that generates global association rules without revealing confidential inputs such as statistical properties of individual sites and yet retains high level of accuracy in resultant rules. One of the important outcomes of the proposed technique is that it reduces the overall communication costs. Performance evaluation of our proposed method shows that it reduces the communication cost significantly when we compare with some well-known distributed association rule mining algorithms. Furthermore, the global rule model generated by the proposed method is based on the exact global support of each itemsets, and hence diminished inconsistency, which indeed occurs when global models are generated from partial support count of an itemset.
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
Zaki, M.J.: Parallel and Distributed Association Mining: A Survey. IEEE Concurrency (October-December 1999)
Rizvi, S.J., Haritsa, J.R.: Maintaining Data Privacy in Association Rule Mining. In: Proc. of 20th International Conference on Very Large Databases, Hong Kong (2002)
Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy Preserving Mining Association Rules. In: Proc. of the SIGKDDD 2002 (2002)
Vaidya, J., Clifton, C.: Privacy Preserving Association Rule Mining in Vertically Partitioned Data. In: Proc. of ACM SIGKDD (July 2002)
Kantercioglu, M., Clifton, C.: Privacy Preserving Distributed Mining of Association Rules on Horizontal Partitioned Data. In: Proc. of DMKD (2002)
Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure Limitation of Sensitive Rules. In: Proc. of the KDEX (November 1999)
Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding Association Rules by Using Confidence and Support. In: Proc. of the Intl. Info. Hiding Workshop(IHW) (April 2001)
Agrawal, R., Shafer, J.C.: Parallel Mining of Association Rules. IEEE Transactions on Knowledge and Data Engineering 8(6), 962–969 (1996)
Cheung, D.W., Ng, V.T., Fu, A.W., Fu, Y.: Efficient Mining of Association Rules in Distributed Databases. In: IEEE TKDE, vol. 8(6), pp. 911–922 (1996)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Database. In: Proc. of the 2oth Intl. Conf. on Very Large Databases, pp. 407–419 (1994)
Goldriech, O.: Secure Multipart Computation Working Draft Version 1.3 (June 2001)
Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases, University of California, Irvine (1998) www.ics.uci.edu/~mlearn/MLRepository.html
Kohavi, R., Broadley, C., Frasca, B., Mason, L., Zheng, Z.: KDD-Cup 2000 organizers report: Peeling the onion. In: SIGKDD Explorations, vol. 2(2), pp. 86–98 (2000), http://www.ecn.purdue.edu/KDDCUP/
Schuster, A., Wolff, R.: Communication-Efficient Distributed Mining of Association Rules. In: Proc. ACM SIGMOD, Santa Barbara,
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ashrafi, M.Z., Taniar, D., Smith, K. (2004). Reducing Communication Cost in a Privacy Preserving Distributed Association Rule Mining. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive