基于改进剪枝的关联规则隐藏算法  

Association Rule hiding Algorithm Based on Improved Pruning

作　　者：龚晨 龚博 Gong Chen;Gong Bo(School of Computer Science and Engineering, Anhui University of Science and Technology, Huainan Anhui 232001, China;School of Automotive and Transportation Engineering, Hefei University of Technology, Hefei, Anhui 230009, China)

机构地区：[1]安徽理工大学计算机科学与工程学院,安徽淮南232001 [2]合肥工业大学汽车与交通工程学院,安徽合肥230009

出　　处：《黑龙江工业学院学报（综合版）》2019年第7期33-37,共5页Journal of Heilongjiang University of Technology(Comprehensive Edition)

基　　金：安徽省高校自然科学研究项目(KJ2018GM03)

摘　　要：针对序列规则重复过多,导致关联规则隐藏算法中数据I/O流的浪费问题,提出一种基于改进剪枝的关联规则隐藏算法。首先将小于阈值的原始单序列利用聚类思想放入同一存储体内,降低挖掘频繁序列的时间;然后将满足阈值条件的序列进行组合,找到满足条件的频繁序列,既实现规则剪枝,又减少遍历次数;最后完成频繁序列隐藏。实验结果表明,该算法与GSP、SPADE算法比较而言,不但提高时间效率,而且更好地实现频繁序列隐藏。For the problem of excessive repetition of sequence rules, which leads to the waste of data I/O flow in the association rule hiding algorithm, an association rule hiding algorithm based on improved pruning is proposed. Firstly, the original single sequence smaller than the threshold is used to put into the same memory, to reduce the time to mine frequent sequences;we combine the sequences that meet the threshold conditions togener to find frequent sequences that meet the conditions, not only achieve rule pruning, but also reduce the number of traversals;we must complete the frequent sequence hiding. The experimental results show that compared with GSP and SPADE algorithms, which not only improves time efficiency, but also achieves frequent sequence hiding.

关 键 词：规则剪枝 频繁序列 阈值 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]