一种关联规则挖掘的高效更新算法

›› 2011, Vol. 24 ›› Issue (10): 85-.

一种关联规则挖掘的高效更新算法

朱红萍,巩青歌

(1.武警工程学院研究生管理大队,陕西西安 710086;2.武警工程学院科研部,陕西西安 710086)

出版日期:2011-10-15 发布日期:2011-10-24
作者简介:朱红萍(1987—),女,硕士研究生。研究方向:数据挖掘与入侵检测。巩青歌(1964—),女,硕士生导师。研究方向:信息安全与数据库。

An Effective Updating Algorithm for Mining Association Rules

ZHU Hong-Ping, GONG Qing-Ge

(1.Management of Graduate Students,Engineering College of CAPF,Xi'an 710086,China;
2.Department of Scientific Research,Engineering College of CAPF,Xi'an 710086,China)

Online:2011-10-15 Published:2011-10-24

摘要/Abstract

摘要：

针对关联规则挖掘中的高效更新问题,对增量和负增量问题进行了讨论,提出当最小支持度发生变化时可归结为数据库发生变化的情形进行讨论。采用十字链表来分别存储原数据库DB和变化数据库db中,各频繁项集及其支持度s₁和s₂,通过对s₁,s₂及最小支持度s₀的比较分析,判断项集是否为频繁项集,减少了扫描数据库的次数,提高了更新后的挖掘效率。并通过仿真实验,证明了算法的高效性。

关键词: 关联规则挖掘, 高效更新, 十字链表, 频繁项集

Abstract:

Both incremental and negative incremental field are discussed aiming at the problem of mining association rules effectively.It is suggested that the problem of change of minimum support can be transformed to the problem of updating database.The crossing lists are used to storage all frequent items and their supports in both the original and the changed database.After analyzing the relation between s₁,s₂ and s₀,whether an item is frequent or not can be figured out.By this method,the I＼O time is largely reduced,and the efficiency of mining association rules has been improved.Finally,the emulation experiment verifies its effectiveness.

Key words: mining association rules;updating effectively;crossing list;frequent item

中图分类号:

TP18

朱红萍, 巩青歌. 一种关联规则挖掘的高效更新算法[J]. , 2011, 24(10): 85-.

ZHU Hong-Ping, GONG Qing-Ge. An Effective Updating Algorithm for Mining Association Rules[J]. , 2011, 24(10): 85-.

[1]	张心静，于嘉威，王红梅. 基于回溯的最大频繁项集挖掘算法[J]. , 2016, 29(8): 78-.
[2]	张翠翠,阮树骅. 用于短频繁项的隐私保护关联规则挖掘方法[J]. , 2016, 29(5): 88-.
[3]	栗青霞, 王换换, 傅喆. 改进的Apriori算法在试题关联分析中的应用[J]. , 2014, 27(2): 35-.