Open Access Open Access  Restricted Access Subscription or Fee Access

Protection of Data from a Semi-Honest Party Using Fast Association Rule Hiding

John Blesswin, Cyju Varghese, Navitha Navitha, Sonia Sonia

Abstract


Data mining technique is an emerging technique applied in strategic decision-making as well as in many more application areas. Nevertheless, it also has a few demerits apart from its utility. The data mining tools may bring out information that should not be disclosed to a semi honest party. Different approaches are being used to hide the sensitive information. This paper proposes a novel method to access the generating transactions from the transactional database. It helps in reducing the time and space complexities of any hiding algorithm. Theoretical and empirical analysis of the algorithm shows that hiding of data using this proposed technique performs
association rule hiding quicker than other algorithms.


Keywords


Data Mining, Association Rules Mining, Privacy, Security, Sanitized Database

Full Text:

PDF

References


D. Agrawal and C.C. Aggarwal, “On the Design and Quantification of Privacy Preserving Data Mining Algorithms,” Proc. ACM PODS Conf.,2001.

R. Agarwal and R.Srikant, “Fast Algorithm for Mining Association Rules,” Proc.20 third International Conference on Very Large Data Bases, pp.487- 499, 1994.

R.Agarwal. T.Imielinski and A. Swami, “Mining Association Rules between Sets of Items in Large Databases,” Proc.ACM International Conferences on Management of Data, pp.207-216 1993.

R. Agrawal and R. Srikant, “Privacy preserving Data Mining,” Proc. ACM SIGMOD Conf., 2000.

Ashrafi, M.Z., Taniar, D., and Smith, K. “PPDAM: Privacy-Preserving Distributed Association-Rule-Mining Algorithm”, International journal of Intelligent Information Technologies, Vol. 1, No. 1, pp 49 – 69,2005.

M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. Verykios,“Disclosure Limitation of Sensitive Rules,” Proc. Knowledge and Data Exchange Workshop, 1999.

C. Clifton and D. Marks, “Security and Privacy Implications of Data Mining,” Proc. ACM Workshop Data Mining and Knowledge Discovery,1996.

C. Clifton, “Protecting against Data Mining through Samples,” Proc.13th IFIP WG11.3 Conf. Database Security, 1999.

Dao-I and Zvi M.Kedam, “Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent set,” IEEE Trans.on Knowledge and Data Engg, vol.14. 2002.

10. U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy , ”Advances in Knowledge Discovery and Data Mining,” AAAI Press/TheMIT Press,1996.

Guanling, Chien-Yu Chang and Arbee L.P Chen, ”Hiding Sensitive Patterns in Association Rules Mining” Proc. Twenty eighth Annual International Conference on Computer software and Applications Conference, 2004

C. Hidber, “Online Association Rules Mining” Proc. ACM SIGMOD Conf. Management of Data, 1999.

Jia-Wei Han, Jain Pei and Yi-WenYin”Mining Frequent Patterns without Candidate Generation,” Proc.ACM International Conference on Management of Data, pp1-12, 2000.

Jia-Wei Han and Micheline Kamber,”Data Mining: Concepts and Techniques”, Morgan Kaufmann Publishers, 2001.

D.G. Marks,”Inference in MLS Database,” IEEE Trans. Knowledge and Data Engg, vol. 8, no. 1, pp. 46-55, 1996.

R.Nedunchezhian and K.Anbumani,” Single Scan Frequent set Generation in Association Rule Mining,” Proc. 1st International Computer Engineering Conference New Technologies for the Information Society, Cairo, Egypt, 2004.

D.E. O’Leary,”Knowledge Discovery as a Threat to Database Security, “Proc. First Int’l Conf. Knowledge Discovery and Databases, pp.107-516, 1991.

Stanley R.M Oliveira and Osmar R.Zainane,”Algorithms for balancing Privacy and knowledge discovery in Association rule mining,” Proc.Seventh International Database Engineering and Applications Symposium, 2003.

Stanley R.M Oliveira and Osmar R.Zainane,”Protecting Sensitive Knowledge by Data sanitization” Proc. Third International Conference on Data Mining, 2003.

Vassilios S. Verykios, Ahmed K. Elmagarmid, Elisa Bertino, Yucel Saygin, and Elena Dasseni,”Association Rule Hiding,” IEEE Transactions On Knowledge And Data Engineering, vol. 16, no. 4, pp 434– 447,2004.

Vassilios S. Verykios, Ahmed K. Elmagarmid, Elisa Bertino, Yucel Saygin, and Elena Dasseni(2003). Association Rule Hiding.

http://dke.cti.gr/CODMINE/ TKDE_Verykios-et-al.pdf

G.I.Webb,” Efficient Search for Association Rules,”Proc.ACM SIGKDD International Conference on Knowledge Discovery and DataMining,pp.99-107, 2000.

D. Burdick, M. Calimlim, J. Flannick, J. Gehrke, and T. Yiu, “Mafia: A Maximal Frequent Itemset Algorithm,” IEEE Trans.Knowledge and Data Eng., vol. 17, no. 11, pp. 1490-1504, Nov.2005.

] M.J. Zaki, “Generating Non-Redundant Association Rules,” Proc. Int’l Conf. Knowledge Discovery and Data Mining, pp. 34-43, 2005

M.J. Zaki and M. Ogihara, “Theoretical Foundations Of Association Rules,” Proc. Workshop Research Issues in Data Mining and Knowledge Discovery (DMKD ’98), pp. 1-8, June 1998.

R.J. Bayardo, Jr., R. Agrawal, and D. Gunopulos, “Constraint- Based Rule Mining in Large, Dense Databases,” Proc. 15th Int’lConf. Data Eng.(ICDE ’99), pp. 188-197, 1999.

M.A. Domingues and S.A. Rezende, “Using Taxonomies to Facilitate The Analysis of the Association Rules,” Proc. Second Int’l Workshop Knowledge Discovery and Ontology’s, held with ECML PKDD, pp. 59-66, 2005.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, “Efficient Mining of Association Rules Using Closed Itemset Lattices,” Information Systems,vol. 24, pp. 25-46, 1999


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.