An Efficient Approach for Privacy Preserving Distributed K-Means Clustering in Unsecured Environment
Authors:
- 4 November 2018
- book chapter
- Published by Springer Nature
- p. 425-431
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A Survey of Privacy-Preserving Methods Across Vertically Partitioned Data2008
- Privacy-preserving distributed k-means clustering over arbitrarily partitioned data2005
- Privacy-preserving distributed clustering using generative models2004
- State-of-the-art in privacy preserving data miningACM SIGMOD Record, 2004
- Privacy-preserving k -means clustering over vertically partitioned data2003
- Privacy Preserving Data Mining2000
- Privacy-preserving data miningACM SIGMOD Record, 2000
- Data clusteringACM Computing Surveys, 1999
- How to generate and exchange secrets1986
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982