首页 | 本学科首页   官方微博 | 高级检索  
     

增量式关联规则维护的时间窗口技术
引用本文:欧阳为民,郑诚. 增量式关联规则维护的时间窗口技术[J]. 安徽大学学报(自然科学版), 2000, 24(1): 12-19
作者姓名:欧阳为民  郑诚
作者单位:1. 安徽大学,计算中心,安徽,合肥,230039
2. 安徽大学,计算机系,安徽,合肥,230039
基金项目:国家自然科学基金;69975001;
摘    要:数据库中的知识发现是指在大型数据集中识别有效、新奇、潜在有用、且最终可理解模式的非平凡的过程。人们已经提出了许多种知识发现算法 ,然而 ,由于数据随时间变化而导致的所发现知识的更新维护问题却较少研究。笔者提出一种用于增量式关联规则维护的时间窗口技术。该技术可以集中在当前数据中发现强关联规则 ,避免利用过时数据。为了避免在已有数据上重新发现 ,降低数据存储开销 ,我们保存了次强关联规则

关 键 词:知识发现  关联规则  时间窗口
文章编号:1000-2162(2000)01-0012-08

A Time Windowing Technique for the Incremental Maintenance of Association Rules
OUYANG Wei-min,ZHENG Cheng. A Time Windowing Technique for the Incremental Maintenance of Association Rules[J]. Journal of Anhui University(Natural Sciences), 2000, 24(1): 12-19
Authors:OUYANG Wei-min  ZHENG Cheng
Abstract:Knowledge discovery in databases is the nontrivial process of identifying valid, novel, potentially useful, and ultimately understandable patterns in large data set. Many techniques have been developed for knowledge discovery, however, comparatively little investigation has been made on maintenance and update of the discovered knowledge as the underlying data changes over time. We propose a time windowing technique for the incremental maintenance of association rules, which can focus on finding strong association rules within current data and avoid the use of outdated data. To avoid re-finding upon existing data and reduce data storage overhead, we store near strong association rules.
Keywords:knowledge discovery  association rules   time window  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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