| 快速关联规则增量式更新算法研究 |
| |
| 引用本文： | 郭有强,胡学钢.快速关联规则增量式更新算法研究[J].安庆师范学院学报(自然科学版),2007,13(2):17-20. |
| |
| 作者姓名： | 郭有强 胡学钢 |
| |
| 作者单位： | 合肥工业大学,计算机与信息学院,安徽,合肥,230009;合肥工业大学,计算机与信息学院,安徽,合肥,230009 |
| |
| 基金项目： | 安徽省科技厅自然科学研究项目(050420207) |
| |
| 摘 要： | 快速关联规则增量式更新算法充分利用以往挖掘过程中的结果,无需再次扫描原数据集,对新增数据集也只扫描一次,即可得到事务更新后的数据集的频繁项集。该算法避免了重新处理已经处理过的数据和多次扫描新增数据集,与其他相关算法相比,极大地减少了算法运行时间,提高了挖掘效率。随着历史数据集的增大,更加显现出本算法的优越性。本算法还可以用于解决由于数据集过大而导致的内存不够的Apriori算法的挖掘问题,相当于数据集分组挖掘。
|
| 关 键 词： | 关联规则 增量式更新 频繁项目集 |
| 文章编号： | 1007-4260（2007）02-0017-04 |
| 修稿时间： | 2006-12-08 |
Study of Rapid Incremental Updating Algorithm for Association Rule |
| |
| GUO You-qiang,HU Xue-gang.Study of Rapid Incremental Updating Algorithm for Association Rule[J].Journal of Anqing Teachers College(Natural Science Edition),2007,13(2):17-20. |
| |
| Authors: | GUO You-qiang HU Xue-gang |
| |
| Institution: | College of Computer and lnfo.,Hefei Industrial University, Hefei 233009, China |
| |
| Abstract: | Rapid incremental updating algorithm makes full use of the results of mining and will get frequent item sets of the item updated data set by scanning the newly-added data set only once without rescanning the original one.The algorithm avoids re-dealing with the data which has been dealt with and repeatedly scanning newly-added data set.Compared with other associating algorithm,it greatly reduces the run-time and improves the mining efficiency.With the enlarging of the historical data set,the superiority will be shown more obvoiusly.And it can also resolve the mining problems of the Apriori algorithm which is due to the too large data set leading to the insufficient memory.And this is equivalent to data set group mining. |
| |
| Keywords: | association rule incremental updating frequent itemsets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
