• •    

一种高效的增量式隐私保护的频繁模式挖掘算法

张亚玲1,王婷1,王尚平2   

  1. 1. 西安理工大学
    2. 西安理工大学计算机科学与工程学院
  • 收稿日期:2017-06-30 修回日期:2017-09-19 发布日期:2017-09-19
  • 通讯作者: 张亚玲

Efficient Increasing Frequent Pattern Mining Algorithm for Privacy-preserving

  • Received:2017-06-30 Revised:2017-09-19 Online:2017-09-19

摘要: 摘 要: 随着大数据时代的到来,挖掘效率已经成为隐私保护的频繁模式挖掘算法的瓶颈,且数据库的少量更新都需要重新运行原算法,往往会造成之前挖掘结果极大的浪费,在挖掘算法中加入更新模型可以提高其效率。针对GRRPH算法在运行过程中需要多次数据库扫描以及计数时多次比较的不足,本文引入bitmap表示数据库中的事务,提出了BRRPH(bitmap based randomized response with partial hiding)算法,实验结果表明BRRPH算法比GRRPH算法具有较高的效率;针对数据库允许的频繁或者偶尔的新增会使得一些现有的强关联规则无效或者弱规则变为强规则的问题,引入了增量更新模型,提出IBRRPH算法。实验结果表明,改进之后的算法IBRRPH在处理数据库发生变化时比原算法具有较高的效率。

关键词: 数据挖掘, 隐私保护, 增量更新

Abstract: Abstract: With the arrival of large data age, efficiency in mining had become the bottleneck of frequent pattern mining algorithms for privacy-preserving, and a small amount of database updates also need to re-run the original algorithm, often resulting in a great waste of mining results before, an update model must be added to the mining algorithm to improve its efficiency. In order to solve the problem that the GRRPH algorithm needs multiple database scans during the running time and counting several times, this paper proposed the improved algorithm BRRPH of GRRPH. BRRPH algorithm uses bitmap technology to represent transaction in the database, the results of the experiment show that the improved algorithm has higher efficiency than the RRPH algorithm. Aimed at the frequent or occasional additions to the database will make some of the existing strong association rules invalid or weak rules become strong rules, this paper introduced an incremental update model, and then proposed the IBRRPH algorithm. The results of the experiment show that the improved algorithm has higher efficiency than the RRPH algorithm.

Key words: data mining, privacy-preserving, incremental update

中图分类号: