挖掘完全频繁项集的蚁群算法
Ants Algorithm for Mining Frequent Itemsets in Larger Database
-
摘要: 关联规则是数据挖掘发现的重要知识,完全频繁项集的发现是挖掘关联规则的关键步骤.蚁群算法是一种元启发式算法,已经有效应用于许多组合优化问题.因此,提出一种新的应用蚁群算法挖掘完全频繁项集的方法.对比实验表明,该算法是智能高效的.Abstract: In the field of data mining,an important issue for association rules generation is frequent itemsets discovery,which is the key factor in implementing association rule mining.The ant colony optimization is one of the meta-heuristics for combinatorial optimization problems.Therefore,a novel approach of applying ant colony optimization for mining frequent itemsets is proposed.Compared experiments show that this algorithm is intelligent and effective.
下载:
