Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
In this paper, we propose a privacy preserving distributed clustering protocol for horizontally partitioned data based on a very efficient homomorphic ...
People also ask
Abstract. In this paper, we propose a privacy preserving distributed clustering protocol for horizontally partitioned data based on a very ef-.
PDF | In this paper, we propose a privacy preserving distributed clustering protocol for horizontally partitioned data based on a very efficient.
In this paper, we focus on designing a novel secret-sharing-based K-means clustering algorithm. Particularly, we present an efficient privacy-preserving K-means ...
Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing. 281. In this paper we propose a new protocol for privacy preserving clustering over.
Efficient privacy preserving distributed clustering based on secret sharing. In PAKDD. 2007 International Workshops: Emerging Technologies in Knowledge.
Abstract. Privacy preserving data mining has gained considerable attention be- cause of the increased concerns to ensure privacy of sensitive information.
This work proposes an efficient, collusion-resistant cryptography based approach for distributed K-Means clustering using Shamir's secret sharing scheme ...
Jun 14, 2021 · Abstract: Clustering is a popular unsupervised machine learning technique that groups similar input elements into clusters. It is used in ...
Nov 9, 2013 · In this paper, we present an efficient, privacy-preserving K-means clustering algorithm in a social network setting. We present a mechanism ...