CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Article:A Model Based Framework for Privacy Preserving Clustering Using SOM

by R.Vidyabanu, N.Nagaveni
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 13
Year of Publication: 2010
Authors: R.Vidyabanu, N.Nagaveni
10.5120/288-450

R.Vidyabanu, N.Nagaveni . Article:A Model Based Framework for Privacy Preserving Clustering Using SOM. International Journal of Computer Applications. 1, 13 ( February 2010), 17-21. DOI=10.5120/288-450

@article{ 10.5120/288-450,
author = { R.Vidyabanu, N.Nagaveni },
title = { Article:A Model Based Framework for Privacy Preserving Clustering Using SOM },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 13 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 17-21 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number13/288-450/ },
doi = { 10.5120/288-450 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:46:24.516272+05:30
%A R.Vidyabanu
%A N.Nagaveni
%T Article:A Model Based Framework for Privacy Preserving Clustering Using SOM
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 13
%P 17-21
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Privacy has become an important issue in the progress of data mining techniques. Many laws are being enacted in various countries to protect the privacy of data.This privacy concern has been addressed by developing data mining techniques under a framework called privacy preserving data mining. Presently there are two main approaches popularly used -data perturbation and secure multiparty computation. In this paper we propose a technique for privacy preserving clustering using Principal component Analysis(PCA) based transformation approach. This method is suitable for clustering horizontally partitioned or centralized data sets .The framework was implemented on synthetic datasets and clustering was done using Self organizing Map(SOM). The accuracy of clustering before and after privacy preserving transformation was estimated.

References
  1. . L. Brankovic and V. Estivill-Castro. Privacy Issues in Knowledge Discovery and Data Mining. In Proc. of Australian Institute of Computer Ethics Conference(AICEC99), Melbourne Victoria,Australia, July 1999.
  2. . P. Jefferies. Multimedia, Cyberspace & Ethics. In Proc. of International Conference on Information Visualisation (IV2000),pages 99-104,London, England, July 2000.
  3. . Lorrie Faith Cranor. Internet privacy. Communications of the ACM, 42(2):28–38, 1999. Stanley R.M Olivereira, Osmar R. Zailane, “Towards Standardization in privacy preserving data mining”, The Privacy-preserving Data Mining: http://www.cs.ualberta.ca/~oliveira/psdm/psdm index.html.
  4. . 104th Congress. Public Law 104-191: Health Insurance Portability and Accountability Act of 1996, August 1996.
  5. . Lorrie Cranor, Marc Langheinrich, Massimo Marchiori, Martin Presler-Marshall, and Joseph Reagle. The Platform for Privacy Preferences 1.0 (P3P1.0) Specification. W3C Recommendation,16 April 2002.
  6. . R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, pages 439–450, Dallas, TX, May 2000.
  7. . G. H. John. Behind-the-Scenes Data Mining. Newletter of ACM SIG on KDDM, 1(1):9–11, June 1999.
  8. . M. J. Culnan. How Did They Get My Name?: An Exploratory Investigation of Consumer Attitudes Toward Secondary Information. MIS Quartely, 17(3):341–363, September 1993.
  9. . Estivill-Castro and L. Brankovic. Data Swapping: Balancing Privacy Against Precision in Mining for Logic Rules. In Proc. of Data Warehousing and Knowledge Discovery DaWaK-99, pages 389–398, Florence, Italy, August 1999.
  10. . D. Agrawal and C. C. Aggarwal. On the Design and Quantification of Privacy Preserving Data Mining Algorithms. In Proc. of ACM SIGMOD/PODS, pages 247–255, Santa Barbara, CA, May 2001.
  11. . Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy Preserving Mining of Association Rules. In Proc. of the 8th ACM SIGKDD Intl. Conf. on Knowlegde Discovery and Data Mining, pages 217–228, Edmonton, AB, Canada, July 2002.
  12. . S. J. Rizvi and J. R. Haritsa. Privacy-Preserving Association Rule Mining. In Proc. of the 28th International Conference on Very Large Data Bases, Hong Kong, China, August 2002.
  13. . K. Muralidhar, R. Parsa, and R. Sarathy. A General Additive Data Perturbation Method for Database Security. Management Science, 45(10):1399–1415, October 1999.
  14. . W. Du and M. J. Atallah. Privacy-preserving cooperative statistical analysis. In Annual ComputerSecurity Applications Conference ACSAC), pages 102–110, New Orleans, Louisiana,USA, December 10-14 2001.
  15. . I.S. Dhillon and D.S. Modha. A data-clustering algorithm on distributed memory multiprocessors.In Proceedings of Large-scale Parallel KDD Systems Workshop (ACM SIGKDD),August 15-18 1999.
Index Terms

Computer Science
Information Sciences

Keywords

PCA SOM Rand Index Transformation matrix

Powered by PhDFocusTM