首页 | 官方网站   微博 | 高级检索  
     

基于滑动窗口的关联规则增量式更新算法
引用本文:夏英,刘婉蓉.基于滑动窗口的关联规则增量式更新算法[J].计算机应用,2008,28(12):3224-3226.
作者姓名:夏英  刘婉蓉
作者单位:重庆邮电大学,中韩GIS研究所,重庆,400065
基金项目:国家高技术研究发展计划(863计划) , 重庆邮电大学科研基金  
摘    要:现有的关联规则算法大多都致力于解决增量式更新问题,需要多次扫描数据集,无法对海量数据进行有效处理。针对此问题,提出了基于滑动窗口的关联规则增量式更新算法(SWIUA),利用滑动窗口进行数据更新,挖掘出用户感兴趣的关联规则。该算法只需要扫描原始数据集和更新的数据各一遍,降低了I/O时间;并采用优化策略对候选项集过滤和删除,提高了关联规则的挖掘性能,能有效处理大量新增数据。

关 键 词:滑动窗口  关联规则  增量式更新  频繁项集
收稿时间:2008-07-01
修稿时间:2008-08-08

Incremental updating algorithm for association rule based on sliding-window
XIA Ying,LIU Wan-rong.Incremental updating algorithm for association rule based on sliding-window[J].journal of Computer Applications,2008,28(12):3224-3226.
Authors:XIA Ying  LIU Wan-rong
Affiliation:XIA Ying,LIU Wan-rongSino-Korea Chongqing GIS Research Institute,Chongqing University of Posts , Telecommunications,Chongqing 400065,China
Abstract:Most of the present association rule algorithms are devoted to the problem of incremental updating, and need to scan the database several times. It is difficult to deal with the large data effectively. The incremental updating algorithm for association rule based on sliding-window (SWIUA) was proposed. This algorithm updates the data by sliding-window, deals with the large new data effectively, and gets the interested and new association rules. It scans the original database and updates data only once, reduces the time of I/O and improves the mining performance of association rules.
Keywords:sliding-window  association rule  incremental updating  frequent items
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号