基于关联规则的利润加权并行算法  

A Parallel Mining Algorithm for Profit Weighted Based on Association Rules

作　　者：石正喜[1] 葛科奇[1] 曹财耀[1] 

机构地区：[1]宁波城市职业技术学院信息学院,浙江宁波315100

出　　处：《计算机与网络》2013年第2期65-67,共3页Computer & Network

基　　金：宁波城市职业技术学院重点课题(课题编号:zzx12033)

摘　　要：介绍了Apriori算法的基本思想,分析了Apriori算法的优点及存在的不足,剖析了新算法的改进思路:尽量减少需要扫描的事务集以及交易的个数和基于划分的方法,然后提出了基于关联规则的利润加权并行挖掘算法,描述了改进的新算法的伪代码,并对伪代码进行了必要的解释说明。算法是在Apriori的基础上做了重大改进,结果表明,改进的算法提高了数据挖掘的效率。This paper introduces Basic idea of Apriori algorithm, It analyzes the strongpoint and shortage of Apriori algorithm and the improvement idea of new algorithm： reduce the number of affair set and exchange to be scanned and based on the method of partition. Then it puts forward a parallel mining algorithm for profit weighted based on association rules. And it describes the pseudocode of improved algorithm and gives necessary explanation for the pseudocode. The improvement is done based on Apriori. The Results show that the improved algorithm improves the efficiency of data mining.

关 键 词：数据挖掘 关联规则 利润加权 并行处理 

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