Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Privacy-preserving k-means clustering over vertically partitioned data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
A Framework for High-Accuracy Privacy-Preserving Mining
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Random-data perturbation techniques and privacy-preserving data mining
Knowledge and Information Systems
Deriving private information from randomized data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Privacy Preserving Data Classification with Rotation Perturbation
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Singular value decomposition based data distortion strategy for privacy protection
Knowledge and Information Systems
Privacy-preserving SVM classification
Knowledge and Information Systems
| Hi-index | 0.00 |
This paper presents nearest neighbor tour circuit encryption algorithm based random Isomap reduction. In order to be suited for privacy-preserving classification, we first alter the selection fashion of the parameters nearest neighbor number k and embedded space dimension d of Isomap reduction algorithm. Further we embed the tourists' sensitive attribution into random dimension space using random Isomap reduction, thus the sensitive attributes are encrypted and protected. Because the transformed space dimension d and nearest neighbor number k are both random, this algorithm is not easily be breached. In addition, Isomap can keep geodesic distance of two points of dataset, so the precision change of classification after encryption can be controlled in a small scope . The experiment show that if we select appropriate parameters, then nearest neighbors of every point may be completely consistent. The present algorithm can guarantee that the security and the precision both achieve the requirements.