广西科学院学报

引用本文：

蒙韧,苏毅娟,朱晓峰,张继连.数据挖掘中的增量式关联规则更新算法[J].广西科学院学报,2006,22(2):125-128. [点击复制]
MENG Ren,SU Yi-Juan,ZHU Xiao-feng,ZHANG Ji-lian.An Efficient Incremental Updating Algorithm in Data Mining for Maintaining Association Rules[J].Journal of Guangxi Academy of Sciences,2006,22(2):125-128. [点击复制]

【打印本页】【在线阅读全文】【下载PDF全文】【查看/发表评论】【下载PDF阅读器】【关闭】

本文已被：浏览 382次下载 383次	码上扫一扫！
数据挖掘中的增量式关联规则更新算法
蒙韧¹, 苏毅娟², 朱晓峰³, 张继连³
0 字体:加大+\|默认\|缩小-
(1.广西师范大学财务处, 广西桂林 541004;2.广西师范学院数学与计算机科学系, 广西南宁 530001;3.广西师范大学数学与计算机学院, 广西桂林 541004)

摘要:

设计增量关联规则更新算法,用于解决数据挖掘中元组数增加而最小支持度不发生变化时关联规则增量式更新问题。该算法只须扫描原始数据库和新增数据库各一遍,能大大降低运算时间,加快速度,极大地提高关联规则的挖掘性能。

关键词: 数据挖掘关联规则增量更新算法

DOI：

投稿时间：2005-09-21修订日期：2006-02-16

基金项目:广西教育厅科学研究项目:区间值数据库中知识发现

An Efficient Incremental Updating Algorithm in Data Mining for Maintaining Association Rules

MENG Ren¹, SU Yi-Juan², ZHU Xiao-feng³, ZHANG Ji-lian³

(1.Finance Department, Guangxi Normal University, Guilin, Guangxi, 541004, China;2.Department of Mathematics and Computer Science, Guangxi Techers College, Nanning, Guangxi, 530001, China;3.College of Mathematics and Computer Science, Guangxi Normal University, Guilin, Guangxi, 541004, China)

Abstract:

Updating association rules is an inevitable yet important issue in data mining.This paper presents a highly efficient updating algorithm,referred to AIUA algorithm,for incrementally maintaining association rules with the same minimum support.This algorithm only takes one-scan on both the original database and the increased dataset.We experimentally evaluated our approach,and demonstrated the efficiency and promising.

Key words: data mining association rule incremental updating algorithm

用微信扫一扫