摘要： 数据挖掘中的关联规则反映一个事件和其他事件之间依赖或相互关联的知识，其中涉及隐私保护方面的问题。该文提出一种基于隐私保护的关联规则挖掘算法及其事务修改算法PPARM，通过对包含敏感项的相关事务做适当的处理，有效地隐藏该类敏感规则。理论分析和实验结果表明，该挖掘算法简单，且具有很好的隐私保护性。

关键词: 数据挖掘, 隐私保护, 关联规则, 敏感项目

Abstract: Association rules mining in data mining reflects relations between events, but it has privacy problems. In order to raise the protection level of data privacy, this paper proposes an effective privacy preserving algorithm namely Privacy Preserving Association Rules Mining(PPARM). It can hide sensitive association rules which contain sensitive items by the way of proper item deletion. Theoretical analysis and experimental results show that the method is simple and has get good privacy.

Key words: data mining, privacy preserving, association rules, sensitive item

中图分类号: 

• TP301.6