首页> 外文会议>Conference on Information Technology To Enhance e-learning and Other Application >Proposed Approach to Sensitive Association Rules Protection based on Compressing and Cryptography: (SARP-CC)
【24h】

Proposed Approach to Sensitive Association Rules Protection based on Compressing and Cryptography: (SARP-CC)

机译:基于压缩和密码学的敏感关联规则保护的建议方法:(SARP-CC)

获取原文

摘要

Privacy-preserving data mining is a modern technology that has been studied by many researchers. There are two types of Privacy-preserving association rules regarding the type of sensitive dataset to be protected, either protect the raw data before performing the data mining process or protect the sensitive knowledge extracted after performing the data mining process. In this research, we will suggest a technique called (SARP-CC) for privacy-preserving data mining. It will be used to protect sensitive knowledge (sensitive association rules) by changing the representation of knowledge from its known form to another, where it is more compressed and encrypted so that it can be sent over a network. The results show that this new compressed and encrypted form reduces storage space and transmission time and facilitates the transmission process over the network, and very beneficial especially for insecure networks. It can also be used as part of secure distributed association rules mining algorithms.
机译:隐私保护数据挖掘是一项现代技术,已被许多研究人员研究。关于要保护的敏感数据集的类型,有两种类型的隐私保护关联规则,一种是在执行数据挖掘过程之前保护原始数据,另一种是在执行数据挖掘过程之后保护提取的敏感知识。在这项研究中,我们将建议一种称为(SARP-CC)的技术,用于保护隐私的数据挖掘。通过将知识的表示形式从已知形式更改为另一种形式,该形式将被进一步压缩和加密,从而可以通过网络发送它,从而用于保护敏感知识(敏感关联规则)。结果表明,这种新的压缩和加密形式减少了存储空间和传输时间,并简化了通过网络的传输过程,尤其对于不安全的网络非常有益。它也可以用作安全的分布式关联规则挖掘算法的一部分。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号