Privacy Preserving Research Based on Association Rule Algorithm

摘要：

Privacy protection based on association rules aim is to find a data set of the original approach, making the mining of sensitive rules is to implement a data mining process is not to be found. To efficiently achieve privacy protection, this article combine the PPARM algorithm and IMBA algorithm, through the operation of sensitive items to do less, it will hidden sensitive rules more greater degree. It is making little effect on non-sensitive rules at the same time. That is making loss rate of the rules of the original database smaller. Theoretical and experimental results show that the algorithm is highly efficient, is a better method related to privacy protection.

关键词： Data mining Association rules Privacy protection Sensitive rules Rule loss rate

作者: Wei Zheng Qingshui Li

作者单位: Computer Science and Technology College Zhejiang University of Technology Hangzhou, China Computer Science and Technology Zhejiang University of Technology Hangzhou, China

会议类型: 国际会议

会议名称: 2011 International Conference on Information and Computer Networks(ICICN 2011)(2011年信息与计算机网络国际会议)

会议地点: 贵阳

会议语种:英文

页码: 254-257

在线出版日期: 2011-01-26（万方平台首次上网日期，不代表论文的发表时间）