摘要： 基于事务对关联规则的贡献程度，提出一种新的敏感规则隐藏算法，包括添加弱相关事务和移除强相关事务2个过程。针对简单型和复合型单一规则，设计4种项目调整方法。实验表明，直接替换法的副作用最小，且只需少量事务更新就能达到要求。算法能抵抗大范围的支持度攻击，当调整因子达到0.07以上时，隐藏率为100%。

关键词: 关联规则隐藏, 事务增减, 数据挖掘, 支持度攻击

Abstract: A new sensitive rule hiding algorithm, including two processes of Weak Association Transaction(WAT) and Strong Association Transaction(SAT), is presented based on the devotion degree of transactions to the mined association rules. For the two types of simple rules and composed rules, four item modification methods are designed for the updating of selected WATs. Experiments demonstrate that the direct substitution method has smallest side effect, and only a few transactions are required in data updating to hide the rule successfully. The robustness to the support attack is satisfying with suitable hiding rate. When the modification factor is set above 0.07, the hiding rate can always be 100% in rule detection process.

Key words: association rule hiding, transaction adding and removing, data mining, support attack

中图分类号: 

• TP301.6