首页> 外文会议>International workshop on distributed computing >Towards Privacy Preserving Distributed Association Rule Mining
【24h】

Towards Privacy Preserving Distributed Association Rule Mining

机译:朝着隐私保留分布式关联规则挖掘

获取原文

摘要

Data mining is a process that analyzes voluminous digital data in order to discover hidden but useful patterns. However, discovery of such hidden patterns may disclose some sensitive information. As a result privacy becomes one of the prime concerns in data mining research. Since distributed association mining discovers global association rules by combining models from various distributed sites hence it breaches data privacy more often than it does in the centralized environments. In this work we present a methodology that generates global association rules without revealing confidential inputs of individual sites. One of the important outcomes of the proposed technique is that, it has an ability to minimize the collusion problem. Furthermore, the global model generated by this method is based on the exact global support of each itemsets, which is indeed a desirable property of distributed association rule mining.
机译:数据挖掘是分析庞大数字数据的过程,以发现隐藏但有用的模式。然而,发现这种隐藏模式的发现可以披露一些敏感的信息。因此,隐私成为数据挖掘研究中的主要问题之一。由于分布式协会挖掘通过组合来自各种分布式站点的模型来发现全局关联规则,因此它比在集中式环境中更频繁地违反数据隐私。在这项工作中,我们介绍了一种生成全球关联规则的方法,而无需揭示个人网站的机密投入。所提出的技术的一个重要结果是,它具有最小化勾结问题的能力。此外,通过该方法生成的全局模型基于每个项目集的精确全局支持,这实际上是分布式关联规则挖掘的理想属性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号