Computational geometry: an introduction
Computational geometry: an introduction
Security-control methods for statistical databases: a comparative study
ACM Computing Surveys (CSUR)
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The new k-windows algorithm for improving the k-means clustering algorithm
Journal of Complexity
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Privacy preserving association rule mining in vertically partitioned data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
An architecture for privacy-preserving mining of client information
CRPIT '14 Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14
Information sharing across private databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Privacy-preserving Distributed Clustering using Generative Models
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Privacy-preserving k-means clustering over vertically partitioned data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Privacy preserving mining of association rules
Information Systems - Knowledge discovery and data mining (KDD 2002)
Unsupervised clustering on dynamic databases
Pattern Recognition Letters
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Hi-index | 0.01 |
The exponential growth of databases containing personal information has rendered the task of extracting high quality information from collections of such databases very important. This task is hindered by the security concerns that arise, due to the confidentiality of the data records, and the reluctance of the organizations to disclose their data. This paper proposes a clustering algorithmic scheme that ensures privacy and confidentiality of the data without compromising the effectiveness of the clustering algorithm nor imposing high communication costs.