PRESERVATION OF THE PRIVACY FOR MULTIPLE CUSTODIAN SYSTEMS WITH RULE SHARING
B. Murugeshwari1, C. Jaya Kumar1 & K. Sarukesi2 Show affiliations
- , India
- Hindustan University, India
Journal of Computer Science, Volume 9, Issue 9, pp. 1086–1091 · doi.org/10.3844/jcssp.2013.1086.1091
Abstract
The aim of the research work is to mine the data set available with each custodian in a semi honest model, securely without disclosure of any data amongst various custodians involved. No custodian discloses any information. In the proposed scheme in order to reduce the computational complexity, the data partitioning has been done in the horizontal way. The proposed research work consists of a well skilled and planned architecture implementation for achieving the proposed privacy preservation in the data mining filed and used a new hybrid data mining model which is developed for combining commutative RSA and a C5.0 algorithm to generate classification rules. This study utilized real world data collected from an UCI repository and experiments are conducted based on the parameters like time complexity, accuracy and error rate. The proposed model preserve expected level of privacy without any information loss, take less time for computation, lower error rate and improves accuracy.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2013 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Murugeshwari, B., Kumar, C. J. & Sarukesi, K. (2013). PRESERVATION OF THE PRIVACY FOR MULTIPLE CUSTODIAN SYSTEMS WITH RULE SHARING. Journal of Computer Science, 9(9), 1086–1091. https://doi.org/10.3844/jcssp.2013.1086.1091
- Licence
- © Science Publications
- Issue
- Volume 9, Issue 9
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
