摘要
对Apriori算法加以改进,提出了一种更高效的关联规则挖掘算法,在扫描数据库的同时把支持每个项目的事务都标记出来,采用一种新的方法来计算候选项目集的支持度.该算法只需对源数据库进行一次扫描,就可以找出所有的频繁集,具有很高的效率.
Based on Apriori algorithm,this paper presents a more efficient algorithm for association rules mining.The new algorithm adopts a unique way to calculate the supporting degree of every candidate item set by marking the transactions related to each item when scanning the database. This is a high efficient algorithm which can mine all the frequent itemn sets by scanning the source database only once.
出处
《应用科技》
CAS
2005年第7期45-47,共3页
Applied Science and Technology
关键词
数据挖掘
关联规则
频繁集
data mining
association rules
frequent itemnset
