Call for Paper - March 2022 Edition
IJCA solicits original research papers for the March 2022 Edition. Last date of manuscript submission is February 22, 2022. Read More

An Efficient Algorithm for Classification Rule Hiding

Print
PDF
International Journal of Computer Applications
© 2011 by IJCA Journal
Volume 33 - Number 3
Year of Publication: 2011
Authors:
S.Vijayarani
M.Divya
10.5120/4003-5670

S.Vijayarani and M.Divya. Article: An Efficient Algorithm for Classification Rule Hiding. International Journal of Computer Applications 33(3):39-45, November 2011. Full text available. BibTeX

@article{key:article,
	author = {S.Vijayarani and M.Divya},
	title = {Article: An Efficient Algorithm for Classification Rule Hiding},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {33},
	number = {3},
	pages = {39-45},
	month = {November},
	note = {Full text available}
}

Abstract

Data mining is the extraction of the hidden information from large databases. It is a powerful technology with new great potential to analyze important information in the data warehouse. Preserving privacy against data mining algorithms is a new research area. It investigates the side-effects of data mining methods that derive from the privacy diffusion of persons and organizations. Privacy preserving data mining is the emerging field that protects sensitive data. Classification is one of the popular techniques of data mining. Classification is a data mining technique used to predict group membership for data instances. Classification involves finding rules that partition the data into disjoint groups. Many classification rule algorithms are used to generate the classification rules such as OneR, Ridor, and Conjuctive Rule. In this paper, we focus on the problem of privacy preservation in classification rules. The rule based classification algorithms namely C4.5, Ripper and Part algorithms are used for generating rules. The privacy is preserved by hiding the sensitive rules and the new dataset is reconstructed from the non sensitive rules. In this paper the experimental results shows the effectiveness of each algorithm.

Reference

  • Aggelos Delis , Vassilios S. Verykios , Achilleas A. Tsitsonis ,“A data perturbation approach to sensitive classification rule hiding”, SAC '10 Proceedings of the 2010 ACM Symposium on Applied Computing, ACM New York, NY, USA ©2010.
  • Agrawal, R. & Srikant, R. (2000), Privacy-preserving data mining, in ‘Proceedings of the 2000 ACM SIGMOD international conference on Management of data’, ACM Press, pp. 439–450.
  • Atallah, M., Elmagarmid, A., Ibrahim, M., Bertino, E. & Verykios, V. (1999), Disclosure limitation of sensitive rules, in ‘KDEX ’99: Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange’, IEEE Computer Society, Washington, DC, USA, pp. 45–52.
  • Chen, X., Orlowska, M. & Li, X. (2004), A new framework of privacy preserving data sharing, in ‘Proceedings of 4th IEEE International Workshop on Privacy and Security Aspects of Data Mining’, IEEE Press, pp. 47–56.
  • Clifton, C. & Estivill-Castro, V., eds (2002), IEEE ICDM Workshop on Privacy, Security and Data Mining, Vol. 14 of Conferences in Research and Practice in Information Technology, ACS.
  • Clifton, C. & Marks, D. (1996), Security and privacy implications of data mining, in ‘Workshop On Data Mining and Knowledge Discovery’, University of British Columbia Department of Computer Science, Montreal, Canada, pp. 15–19.
  • Domingo-Ferrer, J. & Torra, V., Eds (2004), Privacy in Statistical Databases, Vol. 3050 of LNCS, Springer, Berlin Heidelberg.
  • Estivill-Castro, V., Brankovic, L. & Dowe, D. L. (1999), ‘Privacy in data mining’, Privacy – Law and Policy Reporter 6(3), 33–35.
  • Han, J. and M. Kambert, es, “Data Mining: Concepts and Techniques”, Morgan Kaufmann, San Francisco, 2000.
  • Jeffrey W. Seifert, “Data Mining An Overview”, Analyst in Information Science and Technology Policy Resources, Science, and Industry Division.
  • Juggapong Natwichai, Xue Li, Maria E. Orlowska “A Reconstruction-based Algorithm for Classification Rules Hiding”, Seventeenth Australasian Database Conference (ADC2006), Hobart, Australia. Conferences in Re- search and Practice in Information Technology (CRPIT), Vol.
  • Juggapong Natwichai, Xingzhi Sun, Xue Li, “Data reduction approach for sensitive associative classification rule hiding”, ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75, Australian Computer Society, Inc. Darlinghurst, Australia, Australia ©2007
  • Juggapong Natwichai,Xingzhi Sun, Xue Li, “A Heuristic Data Reduction Approach for Associative Classification Rule Hiding”, IBM Research Laboratory, Beijing, China.
  • Juggapong Natwichai, Xingzhi Sun, Xue Li, “Associative classification rules hiding for privacy preservation”, IBM Research Laboratory, Beijing, China.
  • Jr., R. J. B. & Agrawal, R. (2005), Data privacy through optimal k -anonymization, in ‘Proceedings of the 21st International Conference on Data Engineering’, IEEE Computer Society, pp. 217– 228.
  • Lindell, Y. & Pinkas, B. (2000), Privacy preserving data mining, in ‘Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology’, Springer-Verlag, pp. 36– 54.
  • Mary DeRosa. “Data Mining and Data Analysis for Counterterrorism”.
  • Natwichai, J., Li, X. & Orlowska, M. (2005), Hiding classification rules for data sharing with privacy preservation, in ‘Proceedings of 7th International Conference on Data Warehousing and Knowledge Discovery’, Lecture Notes in Computer Science, Springer, pp. 468–467.
  • Quinlan, J. R. (1993), C4.5: Programs for Machine Learning, Morgan Kaufmann, San Mateo, CA, USA.
  • Thair Nu Phyu, “Survey of Classification Techniques in Data Mining”, Proceedings of the International MultiConference of Engineers and Computer Scientists 2009 Vol I IMECS 2009, March 18 - 20, 2009, Hong Kong.