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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Prototype of Clustering and Classification Model for Privacy Preservation using Single Vector Decomposition

by Richa Lodhi, Anil Suryavanshi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 133 - Number 11
Year of Publication: 2016
Authors: Richa Lodhi, Anil Suryavanshi
10.5120/ijca2016908064

Richa Lodhi, Anil Suryavanshi . Prototype of Clustering and Classification Model for Privacy Preservation using Single Vector Decomposition. International Journal of Computer Applications. 133, 11 ( January 2016), 23-26. DOI=10.5120/ijca2016908064

@article{ 10.5120/ijca2016908064,
author = { Richa Lodhi, Anil Suryavanshi },
title = { Prototype of Clustering and Classification Model for Privacy Preservation using Single Vector Decomposition },
journal = { International Journal of Computer Applications },
issue_date = { January 2016 },
volume = { 133 },
number = { 11 },
month = { January },
year = { 2016 },
issn = { 0975-8887 },
pages = { 23-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume133/number11/23831-2016908064/ },
doi = { 10.5120/ijca2016908064 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:30:54.868941+05:30
%A Richa Lodhi
%A Anil Suryavanshi
%T Prototype of Clustering and Classification Model for Privacy Preservation using Single Vector Decomposition
%J International Journal of Computer Applications
%@ 0975-8887
%V 133
%N 11
%P 23-26
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The single value decomposition technique divides the data of different parties during the process of privacy preservation. The process of single value decomposition implied in the form of clustering and classification. The combined process of clustering and classification called prototype mode for sharing privacy preservation. The utility of vector decomposition in this model is selection of data in different parties for the process of maintain the raw information. In this paper proposed a prototype model for privacy preservation and improved the efficiency of data utility and accuracy of data recovery during the process of privacy. The proposed model implements in MATLAB software and used some standard dataset for evaluation of performance. The proposed model is very efficient in compression of KPPDM model.

References
  1. S KumaraSwamy,Manjula S , K R Venugopal, Iyengar S , L M Patnaik “Association Rule Sharing Model for Privacy Preservation and Collaborative Data Mining Efficiency” IEEE, 2014. Pp 1-6.
  2. Murat Kantarcioglu, Wei Jiang “Incentive Compatible Privacy-Preserving Data Analysis” IEEE, 2013. Pp 1323-1335.
  3. He manta Kumar Bhuyan , Maitri Mohant , Smruti Rekha Das “Privacy Preserving for Feature Selection in Data Mining Using Centralized Network” IJCSI, 2012. Pp 434-440.
  4. Manish Sharma, Atul Chaudhary, Manish Mathuria, Shalini Chaudhary “A Review Study on the Privacy Preserving Data Mining Techniques and Approaches” IJCST, 2013. Pp 42-46
  5. K. Srinivasa Rao, B. Srinivasa Rao “An Insight in to Privacy Preserving Data Mining Methods” CSEA, 2013. Pp 100-104.
  6. Julien Freudiger, Shantanu Rane, Alejandro E. Brito , Ersin Uzun PARC “Privacy Preserving Data Quality Assessment for High-Fidelity Data Sharing” ACM, 2014. Pp 1-9.
  7. Kumaraswamy S, Manjula S, K R Venugopal, L M Patnaik “A Data Mining Perspective in Privacy Preserving Data Mining Systems” IJCST, 2014. Pp 704-711.
  8. Beula Amalorpavam, N. Mookhambik “privacy preserving decision tree learning using unrealized data sets” IJITCSP, 2013. Pp 187-192.
  9. Ms.R.Kavitha, D.Vanathi “A Study Of Privacy Preserving Data Mining Techniques” IJCAIT, 2014. Pp 71-77.
  10. Yaping Li, Minghua Chen, Qiwei Li , Wei Zhang “Enabling Multi-level Trust in Privacy Preserving Data Mining” IEEE, 2011. Pp 1-20.
  11. Somayyeh Seifi Moradi, Mohammad Reza Keyvanpour “classification and evaluation the privacy preserving distributed data mining techniques” Journal of Theoretical and Applied Information Technology, 2012. Pp 204-210.
  12. M. Kantarcioglu, R. Nix “Incentive Compatible Distributed Data Mining” Proc. IEEE Int’l Conf. Soc. Computing/IEEE Int’l Conf. Privacy, Security, Risk and Trust, Pp 735-742, 2010.
  13. M. Kantarcglu, C. Clifton “Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 9, 2004, Pp 1026-1037.
  14. H. Kargupta, K. Das, and K. Liu “A Game Theoretic Approach toward Multi-Party Privacy-Preserving Distributed Data Mining” Proc. 11th European Conf. Principles and Practice of Knowledge Discovery in Databases, 2007, Pp 523-531.
  15. S. Mukherjee, H. Kargupta “Distributed Probabilistic Inferencing in Sensor Networks using Variational Approximation”. J. Parallel Distrib.Comput.,2008, Pp78–
Index Terms

Computer Science
Information Sciences

Keywords

Clustering classification sample selection PPDM

Powered by PhDFocusTM