An Efficient Association Rule Hiding Algorithm Based on Cluster and Threshold Interval
-
摘要: 关联规则隐藏是隐私保护数据挖掘(privacy-preserving data mining, PPDM)的一种重要方法.针对当前的关联规则隐藏算法直接操作事务数据、I/O开销较大的缺陷，提出一种基于FP-tree快速关联规则隐藏的算法FP-DSRRC.算法首先对FP-tree的结构进行改进，增设事务编号索引并建立双向遍历结构，进而利用改进的FP-tree对事务信息进行快速处理，避免了遍历原始数据集产生的大量I/O时间；然后通过建立和维护事务索引表实现对敏感项的快速查找，并基于分簇策略对关联规则处理，以簇为单位进行敏感规则消除，同时采用规则支持度和置信度阈值区间的思想，减少了关联规则隐藏处理对原始数据集的影响；最后通过实验测试证明:相较于传统关联规则隐藏算法，FP-DSRRC算法在保证生成的数据集质量的同时，减少了50%~70%的算法执行时间，并在大规模真实数据集上有较好的可用性.Abstract: Association rules hiding is a very important method of privacy-preserving data mining (PPDM). Because the current association rules hiding algorithm operates the transaction database directly, it leads to a lot of I/O overhead. To solve this problem, we put forward a quick association rules hiding algorithm based on FT-tree, called FP-DSRRC. Firstly, the algorithm improves the structure of FP-tree by adding an index to the transaction number and establishing the bidirectional traverse structure. Then FP-DSRRC uses the improved FP-tree to quickly handle transaction data set, avoiding a large number of I/O overhead caused by traversal the raw transaction data set. Furthermore, FP-DSRRC finds the sensitive items quickly by building and maintaining a transaction index table, and then handles the association rules based on the clustering strategy. We eliminate the sensitive rules by clusters, and reduce the negative influence caused by association rules hiding progress to the original data set by adopting the idea of rule support and confidence degree interval at the same time. Finally, the experiment shows that compared with traditional association rules hiding algorithm, the executive time of FP-DSRRC has been decreased by 50%~70% while guaranteeing the quality of general data, moreover, FP-DSRRC has better availability on a large-scale real data set.
-
Keywords:
- privacy preservation /
- association rule hiding /
- FP-tree /
- sensitive rule /
- data sanitization
-
-
期刊类型引用(9)
1. 杨海龙，靳新华. 基于ECC复合加密的医院网络隐私信息安全保护方法. 自动化技术与应用. 2024(08): 140-143+166 . 
百度学术
2. 贾卉楠，王斌. 基于移动群智感知的隐私保护研究. 佳木斯大学学报(自然科学版). 2024(09): 16-18+69 . 百度学术
3. 杨小琴，朱玉全. 网络加密数据跨平台迁移自适应决策模型构建. 计算机仿真. 2023(01): 437-440+516 . 百度学术
4. 蒋沥泉，秦志光. 基于属性隐藏的高效去中心化的移动群智数据共享方案. 电子科技大学学报. 2023(06): 915-924 . 百度学术
5. 蔡波. 马尔可夫预测的移动群智感知网络日志信息收集. 西安工程大学学报. 2022(01): 115-120 . 百度学术
6. 佘晓萌 ，杜洋 ，马文静 ，殷赵霞 . 基于像素预测和块标记的图像密文可逆信息隐藏. 计算机研究与发展. 2022(09): 2089-2100 . 本站查看
7. 王磊，陈磊，张明儒，魏敏，李晋先. 面向数据库查询的非结构化数据融合存储系统. 电子设计工程. 2022(24): 148-152 . 百度学术
8. 李卓，宋子晖，沈鑫，陈昕. 边缘计算支持下的移动群智感知本地差分隐私保护机制. 计算机应用. 2021(09): 2678-2686 . 百度学术
9. 熊金波，毕仁万，田有亮，刘西蒙，马建峰. 移动群智感知安全与隐私:模型、进展与趋势. 计算机学报. 2021(09): 1949-1966 . 百度学术
其他类型引用(13)
计量
- 文章访问数: 1079
- HTML全文浏览量: 3
- PDF下载量: 393
- 被引次数: 22
下载:
