Call for Paper - July 2022 Edition
IJCA solicits original research papers for the July 2022 Edition. Last date of manuscript submission is June 20, 2022. Read More

Privacy Preservation with Attribute Reduction in Quantitative Association Rules using PSO and DSR

Print
PDF
IJCA Special Issue on Information Processing and Remote Computing
© 2012 by IJCA Journal
IPRC - Number 1
Year of Publication: 2012
Authors:
G. Sudha Sadasivam
S. Sangeetha
K. Sathyapriya

Sudha G Sadasivam, S Sangeetha and K Sathyapriya. Article: Privacy Preservation with Attribute Reduction in Quantitative Association Rules using PSO and DSR. IJCA Special Issue on Information Processing and Remote Computing IPRC(1):19-30, August 2012. Full text available. BibTeX

@article{key:article,
	author = {G. Sudha Sadasivam and S. Sangeetha and K. Sathyapriya},
	title = {Article: Privacy Preservation with Attribute Reduction in Quantitative Association Rules using PSO and DSR},
	journal = {IJCA Special Issue on Information Processing and Remote Computing},
	year = {2012},
	volume = {IPRC},
	number = {1},
	pages = {19-30},
	month = {August},
	note = {Full text available}
}

Abstract

Data mining aims at extracting hidden information from data. Data mining poses a threat to information privacy. Privacy preserving data mining hides the sensitive rules and prevents the data from being disclosed to the public. Attribute reduction techniques reduce the dimensionality of dataset. Rough sets are used for attribute reduction to yield reduced sets. An attribute reduct is a subset of attributes formed using rough sets. This paper proposes two approaches to hide sensitive fuzzy association rules namely, decreasing support value of item in RHS of association rule and Particle Swarm Optimization (PSO). The proposed approach is implemented using map reduce paradigm. Experimental results demonstrate the performance of the proposed approach.

References

  • Author, (2011) "A New method for preserving privacy in Quantitative Association Rules Using DSR approach with automated generation of membership function", Information and communication technologies (WICT). 2011 world congress on 11 -14 Dec 2011, Mumbai, India, pp 148 – 153
  • M. Banerjee; S. Mitra and A. An(2006). Feature Selection Using Rough Sets. In: Multi-Objective Machine Learning, Ed. Yaochu Jin, Series on Studies in Computational Intelligence 16 (Springer-Verlag, Berlin), pp. 3-20.
  • T. Berberoglu and M. Kaya,(2008) "Hiding Fuzzy Association Rules in Quantitative Data",The 3rd InternationalConference on Grid and Pervasive Computing Workshops, pp. 387-392.
  • E. P. M. de Sousa; C. Traina; A. J. M. Traina; L. Wu and C. Faloutsos,(2007), "A Fast and Effective Method to Find Correlations among Attributes in Databases," Data Mining and Knowledge Discovery, vol. 14, pp. 367-407.
  • J. Zh. Dong; N. Zhong and S. Ohsuga. Using rough sets with heuristics for feature selection. N. Zhong (Eds. ):RSFDGrC'99, Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing Pages178-187Springer-Verlag London, UK ©1999.
  • . R. Jenshen and Q. Shen. (2004b) Semantics-Preserving Dimensionality Reduction: Rough and Fuzzy-Rough-Based Approaches. IEEE Transactions on Knowledge and Data Engineering,2004, Vol. 16, Issue:12, pp. 1457-1471.
  • . Jitendra kumar and Binit Kumar Sinha(2010), "privacy preserving clustering in Data Mining" , B. Tech Thesis, NIT, Rourkela, India.
  • . Neil Mac Parthala´in; Qiang Shen and Richard Jensen,(2010) ," A Distance Measure Approach to Exploring the Rough Set Boundary Region for Attribute Reduction". IEEE transaction on Knowledge and data engineering, Vol. 22, No. 3, pp. 305-317.
  • . Paramjeet; V. Ravi; Naveen Nekuri; Chillarige Raghavendra Rao; (2012), "Privacy preserving data mining using particle swarm optimization trained auto-associative neural network: an application to bankruptcy prediction in banks", International journal of data mining, modeling and management Vol. 4, No. 1, pp. 39-56
  • . Q. Shen and R. Jensen,(2004a) "Selecting Informative Features with Fuzzy-Rough Sets and Its Application for Complex Systems Monitoring," Pattern Recognition, vol. 37, no. 7, pp. 1351-1363
  • . A. Skowron and C. Rauszer. (1992) The Discernibility Matrices and Functions in Information Systems. Handbook of applications and advances of the Rough set theory,Intelligent Decision Support,331-362.
  • . Vassilios S. Verykios; Elisa Bertino; et al. ,(2004) "State-of-the-art in Privacy Preserving Data Mining," SIGMOD Record, Vol. 33, No. 1, pp. 50-57.
  • . G. Y. Wang. "Rough Set Theory and Data Mining". Xi'an Jiaotong University Press,Xi'an, 2001.
  • . G. Y. Wang; J. Zhao; J. J. An, et al. (2004) Theoretical study on attribute reduction of rough set theory: comparison of algebra and information views. In: Proceedings of the Third IEEE International Conference on Cognitive Informatics,pp-148 – 155.
  • . Wu Xiaodan; Chu Chao-Hsien; Wang Yunfeng; Liu Fengli; Yue Dianmin,(2007) Privacy Preserving Data Mining Research: Current Status and Key Issues, Computional Science- ICCS ,pp:762-772.
  • . Yongcheng Luo; Yan Zhao; Jiajin Le, I, (2009)"A Survey on the Privacy Preserving Algorithm of Association Rule Mining",IEEE Explore electronic commerce and security, vol. 1, pp. 241-245 .