| 基于事务压缩的频繁项集挖掘和更新算法 |
| |
| 引用本文： | 樊玫,段隆振,陈桂香,黄龙军.基于事务压缩的频繁项集挖掘和更新算法[J].南昌大学学报(理科版),2006,30(5):500-503. |
| |
| 作者姓名： | 樊玫 段隆振 陈桂香 黄龙军 |
| |
| 作者单位： | 1. 南昌大学,信息工程学院,江西,南昌,330031
2. 江西师范大学,软件学院,江西,南昌,330046 |
| |
| 摘 要： | 频繁项集挖掘是挖掘关联规则的关键。为了得到用户感兴趣的关联规则，要不断调整最小支持度，这必将引起频繁项集的更新。基于事务压缩思想，提出一种挖掘和更新算法，挖掘频繁项集时扫描压缩的数据库，更新时能减少新产生的k-项集的数量，从而加快了更新速度。
|
| 关 键 词： | 数据挖掘 频繁项集 关联规则 |
| 文章编号： | 1006-0464（2006）05-0500-04 |
| 收稿时间： | 2006-06-10 |
| 修稿时间： | 2006年6月10日 |
An Algorithm for Renewing Frequent Item Sets Based on Redundant Transaction Compression idea |
| |
| FAN Mei,DUAN Long-zhen,CHEN Gui-xiang,HUANG Long-jun.An Algorithm for Renewing Frequent Item Sets Based on Redundant Transaction Compression idea[J].Journal of Nanchang University(Natural Science),2006,30(5):500-503. |
| |
| Authors: | FAN Mei DUAN Long-zhen CHEN Gui-xiang HUANG Long-jun |
| |
| Institution: | 1. College of Information Engineering, Nanchang University, Nanchang 330031, China ; 2. College of Software, Jiangxi Normal University, Nanehang 330046, China |
| |
| Abstract: | Finding frequent item sets is the key to mine association rules. The paper should adjust the threshold values with minimum support in order to get users interested rules, and that must lead to the revising of thresholds. It proposes an algorithm for data mining and revising of thresholds based on redundant transaction compression, it scans the reduced database when mining the frequent item sets, and it can reduce the amounts of k-frequent item sets when updataing it . so it speeds up the renewing speed. |
| |
| Keywords: | data mining frequent item sets associat on rule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
