摘要
介绍了常见的10种关联规则算法:AIS算法、SETM算法、Apriori算法等,并对各种算法的性能进行了分析比较.其中SETM算法效率最低,但和DBMS集成的最好,AVM算法效率最高,但只适用于布尔类型的关联规则.
In this paper, ten familiar association rules algorithms are discussed which are AIS algorithm, SETM algorithm, Apriori algorithm etc. We compare and analyze their performance. Among all the algorithms, the most inefficient one is SETM algorithm but it is the most convenient one to combine DBMS. The most efficient one is AVM algorithm but it is only used in the association rules of boolean variable.
出处
《大连民族学院学报》
CAS
2005年第5期39-42,共4页
Journal of Dalian Nationalities University
关键词
数据挖掘
关联规则
频繁项集
算法
data mining
association rules
frequent itemset
algorithm
