| 垂直分布下的隐私保护频繁闭合项集挖掘算法 |
| |
| 引用本文： | 明媚,缪裕青,李世令,李云辉.垂直分布下的隐私保护频繁闭合项集挖掘算法[J].桂林电子科技大学学报,2014(4):295-299. |
| |
| 作者姓名： | 明媚 缪裕青 李世令 李云辉 |
| |
| 作者单位： | 桂林电子科技大学计算机科学与工程学院,广西桂林,541004 |
| |
| 基金项目： | 广西教育厅科研项目（LD13037B,201204LX122）,广西可信软件重点实验室开放基金（kx201116） |
| |
| 摘 要： | 针对垂直分布下的隐私保护关联规则挖掘算法效率低、安全性不高的问题,提出一种隐私保护频繁闭合项集的挖掘算法。算法利用挖掘频繁闭合项集代替频繁项集,IT-Tree作为搜索空间,Diffsets作为压缩结构,采用基于RSA可交换加密算法的隐私保护集合差集协议。实验结果表明,算法具有较好的隐私性、准确性、高效性。
|
| 关 键 词： | 隐私保护 关联规则 频繁闭合项集 差集协议 Diffsets |
Privacy preserving frequent closed itemsets mining algorithm in vertically partitioned data |
| |
| Ming Mei,Miao Yuqing,Li Shiling,Li Yunhui.Privacy preserving frequent closed itemsets mining algorithm in vertically partitioned data[J].Journal of Guilin Institute of Electronic Technology,2014(4):295-299. |
| |
| Authors: | Ming Mei Miao Yuqing Li Shiling Li Yunhui |
| |
| Affiliation: | (School of Computer Science and Engineering, Guilin University of Electronic Technology, Guilin 541004, China) |
| |
| Abstract: | The existing privacy preserving association rule mining algorithms in vertically partitioned data is lower efficient and unsafe,so a new privacy protection algorithm for mining frequent closed itemsets is proposed.The algorithm generates frequent closed itemsets instead of frequent itemsets with IT-Tree as the search space and Diffsets as a compressed struc-ture.The algorithm uses the difference set of privacy preserving protocol based on exchangeable RSA encryption.Theoreti-cal analysis and experimental results show that the algorithm improves security,accuracy and efficiency. |
| |
| Keywords: | privacy protection association rule frequent closed itemsets difference set protocol Diffsets |
| 本文献已被 CNKI 维普 等数据库收录！ |
