基于FUP算法的关联规则增量算法的研究  

Research on an Association Rule Algorithm based on FUP

作　　者：王新龙[1] 李强[2] 

机构地区：[1]长治学院计算机系,山西省长治市046001 [2]广西大学计算机与电子信息学院,广西南宁5300044

出　　处：《微计算机信息》2009年第3期279-280,215,共3页Control & Automation

摘　　要：关联规则挖掘作为数据挖掘中的一个重要领域,目前已在商业、教育、科研等领域有了许多成功应用,这使它成为数据挖掘中最成熟、最重要、最活跃的一个分支。本文首先提出了FUP算法以及一些已有的改进,并提出了一种新的改进算法MFUP,主要是针对FUP算法中对原数据库扫描次数太多的缺点做了改进,大大减少了扫描次数,并省略了连接后的剪枝步骤。As an important field in data mining, the association rules mining presently has applied successfully in the fields of commerce, education, scientific research etc., which has become a most important and most active branch in data mining. The FUP algorithm and some existing improvement were introduced, and then new improvement algorithm--MFUP was given. It mainly focuses on the shortage in algorithm FUP that need scan database too many times. In algorithm MFUP, the times of scanning database is reduced greatly, when simultaneously, the pruning step can be overleaped.

关 键 词：关联规则 数据挖掘 MFUP算法 

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