International Research journal of Management Science and Technology

  ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 61    Submit Your Rating     Cite This   Download        Certificate

A MODEL FOR PRESERVING PRIVACY OF SENSITIVE CATEGORICAL DATA

    2 Author(s):  SHALINI LAMBA , S. QAMAR ABBAS

Vol -  5, Issue- 10 ,         Page(s) : 13 - 25  (2014 ) DOI : https://doi.org/10.32804/IRJMST

Abstract

Abstract- The aim of data mining is attaining fresh and precious knowledge from data. In many cases, the extracted knowledge is highly private and it needs sanitization before giving to data mining researchers and the public in order to address privacy concerns. In this paper we presented a model using privacy preserving technique that adds noise to each and every attribute, both numerical and categorical, of a data set. We added noise in such a way so that a high data quality is preserved in the perturbed data set. Therefore, the perturbed data set can be used for classification, prediction and correlation analyses. More-over, since we add a little amount of noise the perturbed data set can also be used for many other data analyses. Since noise is added to all attributes, it makes record re-identification determining the confidential class values difficult.

  1. J. Han and M. Kamber. Data Mining Concepts and Techniques. Morgan Kaufmann Publishers, San Diego, CA 92101-4495,USA, 2001.
  2. M. Kantardzic. Data Mining Concepts, Models, Methods, and Algorithms. IEEE Press, NJ, USA, 2003.
  3. E. Schuman. At wal-mart, world's largest retail data warehouse gets even larger. available from http://www.eweek.com/article2/0,1759,1675960,00.asp, 10 2004. visited on 29.03.05.
  4. Wikipedia.Market trends. available from http://en.wikipedia.org/wiki/Market trends. visited on 07.07.06.
  5. Muralidhar K. and Sarathy R. “Data Shufflinga new masking approach for numerical data”, Management Science, forthcom-ing, 2006.
  6. V.S. Iyengar, “Transforming data to satisfy privacy constraints”, In Proc. of SIGKDD’02,Edmonton, Alberta, Canada,2002.
  7. R.R.Rajalaxmi, A.M.Natarajan “An EffectiveData Transformation Approach for Privacy Preserving Clustering”, Journal of Computer Science 4(4): 320-326, 2008.
  8. V.Vallikumari, S.Srinivasa Rao, KVSVN Raju, KV Ramana, BVS Avadhani “Fuzzy based approach for privacy preserving publication of data”, IJCSNS, Vol.8 No.1, January 2008.
  9. B. Pinkas. Cryptographic techniques for privacy-preserving data mining. SIGKDD Explorations, 4(2), December 2002.
  10. E. Lefons, A. Silvestri, and F. Tangorra. An analytic approach to statistical databases. In 9th Int. Conf. Very Large Data Bases, pages 260-- 274. Morgan Kaufmann, Oct-Nov 1983.
  11. Agrawal R.,Srikant R., ``Privacy Preserving Data Mining.,'' In the Proceedings of the ACM SIGMOD Conference. 2000.
  12. IEEE Transactions on Knowledge and Data Engineering.,Vol.18,No.1,2006.
  13. K.Muralidhar.,R.Sarathy.,``A General additive data perturbation method for data base security.,'' Journal of Management Science.,45(10):1399-1415,2002.
  14. Li Liu., Murat Kantarcioglu.,Bhavani Thuraisingham. ``Privacy Preserving Decision Tree mining from Perturbed Data.,'' In proceedings of 42nd Hawaii International Conference on System Sciences.,2009.
  15. Chen K.,Liu L. ``A random rotation perturbation approach to privacy data classification.,'' Proceedings of IEEE Conference on Data Mining (ICDM). pp.589-592,2005
  16. S.Merugu.,J.Ghosh., ``Privacy Preserving Distributed Clustering using generative models.,'' In  Proceedings of 3rd IEEE International Conference on Data Mining (ICDM03). Vol.19,Issue 22,pp.211-218, 2003.
  17. S.R.M.Olivera and O.R.Zaine., ``Privacy Preservation when sharing data for clustering.,'' In Proceedings of the International Workshop on Secure Data Management in a Connected World., 2004.
  18. Jaideep Vaidya and Clifton C.,``Privacy Preserving k-means clustering over vertically partitioned data.,'' In Proceedings of ACM SIGKDD Conference, pp.206-215,2003.
  19. Mohammad Ali Kadampur., Somayajulu D V L N., S.S.Shivaji Dhiraj.,G.P.Satyam.,.``Privacy Preserving Clustering by Cluster Bulging for Information Sustenance.,'' Proceedings of 5th International Conference on Information Automation for Sustenance (ICIAFS08), 2008.
  20. Vassillios S.Verykios.,Ahmed K. Elmagarmid., Elisa Bertino.,``Association Rule Hiding.,'' IEEE Transactions on Knowledge andData Engineering.,Vol.16, No.4,April 2004.
  21. Pinkas B.”Cryptographic Techniques for Privacy-Preserving Data Mining” ACM SIGKDD Explorations, 4(2),2002
  22. Agrawal D. Aggarwal C.C. “ On the Design and Quantification of Privacy Preserving Data mining algorithms.” ACM PODS Conference, 2002.
  23. Muralidhar K. and Sarathy R. “ Data Shuffling- a new masking approach for numerical data.” Management Science, forthcoming,2006.
  24. V.S. Iyengar.”Transforming data to satisfy privacy constraints”In Proc. of SIGKDD’02, Edmonton, Alberta,Canada,2002.
  25. A.A.Hintoglu and Y.Saygin. “Suppressing microdata to prevent probabilistic classification based inference” In Proc. of Secure Data Management, 2nd VLDB workshop,SDM 2005 pp155-169, Trondheim Norway 2005.
  26. S.Rizvi, J.R. Harista “Maintaining data privacy in association rule mining” In Proc. of 28th VLDB Conference, pp682-693,Honk Kong China, 2002.
  27. Shibanth Mukharjee.,Zhiyuan Chen.,Arya Gangopadhyay “A privacy preserving technique for Euclidean distance-based mining algorithms using Fourier-related transforms” The VLD`B journal 2006
  28. Lindell Y., Pinkas B.”Privacy preserving Data Mining“CRYPTO 2000.
  29. Yu H.,Jiang X., Vaidya J.”Privacy Preserving SVM using nonlinear Kernels on Horizontally partitioned Data. SAC Conference,2006.
  30. Yu.H.,Vaidya J.,Jiang X.”Privacy preserving SVM Classification on vertically partitioned data” PAKDD conference, 2006.
  31. J.F. Traub, Y. Yemini, and H. Woznaikowski. The statistical security of a statistical database. ACM TODS, 9(4):672-679, Dec.1984.
  32. Dakshi Agrawal and Charu C. Aggarwal, On the design and quantification of Privacy Preserving Data Mining algorithms, In Proceedings of the 20th ACM Symposium on Principles of Database Systems (2001), 247–255.

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details