摘要
在挖掘关联规则的过程中,关键步骤是产生频繁项集.基于频繁项集支持矩阵的思想,提出一种有效的频繁项集挖掘算法—FIMA,并给出了算法的基本设计思想和算法描述.本算法利用矩阵挖掘频繁项集,不需要产生候选项集,且只需扫描数据库一次,所以此算法是非常有效的.
In the mining process of association rules, the essential step is generating frequent itemset. One kind of effective mining algorithm for frequent itemset is presented and the algorithm basic design thought and the algorithm deseription is produced, based on the thought of the frequent itemset support matrix. Using matrix to mining frequent itemset, this algorithm only needs a time of scanning database without qenerating the candidate itemset. Therefore, this algorithm is extremely effective.
出处
《山东师范大学学报（自然科学版）》
CAS
2006年第1期46-48,共3页
Journal of Shandong Normal University(Natural Science)
关键词
数据挖掘
关联规则
频繁项集
data mining
association rules
frequent itemset
