基于矩阵的增量式关联规则挖掘算法  

Incremental updating algorithm based on matrix for mining association rules

作　　者：倪志伟[1] 高雅卓[1] 李伟东[1] 束建华[1] 

机构地区：[1]合肥工业大学管理学院,合肥230009

出　　处：《计算机工程与应用》2008年第13期153-155,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.70631003);国家高技术研究发展计划(863)(the National High-Tech Research and Development Plan of China under Grant No.2007AA04Z116)

摘　　要：关联规则是数据挖掘的重要研究内容之一。针对数据库数据增加的同时最小支持度发生改变的关联规则更新维护问题,提出了一种基于矩阵的增量式关联规则挖掘算法IUBM。该算法采用简单的数组和位运算,在执行关联规则的更新时,既不用多次扫描数据库,也不产生庞大的候选项集。实例表明,该算法的时间复杂度和空间复杂度大大降低。Association rules is an important part of data mining research.This paper proposes the improved incremental updating algorithm based on matrix named IUBM （Incremental Updating Algorithm based on Matrix）,in order to deal with the updating problems of association rules when the transaction database increases and the minimum support changes.Arrays and bit operation are adopted by the algorithm,the database will not be scanned for many times and the enormous candidate itemsets will not be produced.It＇s proved that the time complexity and space complexity of the algorithm are effectively reduced.

关 键 词：关联规则 矩阵 增量更新 频繁项集 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]