首页> 外文会议>2015 IEEE Conference on Collaboration and Internet Computing >Privacy-Preserving and Outsourced Multi-user K-Means Clustering
【24h】

Privacy-Preserving and Outsourced Multi-user K-Means Clustering

机译:隐私保护和外包多用户K均值聚类

获取原文
获取原文并翻译 | 示例

摘要

Many techniques for privacy-preserving data mining (PPDM) have been investigated over the past decade. Such techniques, however, usually incur heavy computational and communication cost on the participating parties and thus entities with limited resources may have to refrain from participating in the PPDM process. To address this issue, one promising solution is to outsource the tasks to the cloud environment. In this paper, we propose a novel and efficient solution to privacy-preserving outsourced distributed clustering (PPODC) for multiple users based on the k-means clustering algorithm. The main novelty of our solution lies in avoiding the secure division operations required in computing cluster centers through efficient transformation techniques. In addition, we discuss two strategies, namely offline computation and pipelined execution that aim to boost the performance of our protocol. We implement our protocol on a cluster of 16 nodes and demonstrate how our two strategies combined with parallelism can significantly improve the performance of our protocol through extensive experiments using a real dataset.
机译:在过去的十年中,已经研究了许多用于保护隐私的数据挖掘(PPDM)的技术。然而,这样的技术通常在参与方上引起沉重的计算和通信成本,因此资源有限的实体可能不得不避免参与PPDM过程。为了解决此问题,一种有前途的解决方案是将任务外包给云环境。在本文中,我们提出了一种基于k-means聚类算法的新颖,有效的多用户隐私保护外包分布式聚类(PPODC)解决方案。我们解决方案的主要新颖之处在于,通过有效的转换技术避免了计算集群中心所需的安全分区操作。另外,我们讨论了两种策略,即脱机计算和流水线执行,旨在提高协议的性能。我们在16个节点的群集上实现我们的协议,并通过使用真实数据集的大量实验证明了我们的两种策略与并行性相结合如何能够显着提高协议的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号