Apriori算法的一种改进研究

Research of an Improved Apriori Algorithm

挖掘频繁项集是近年数据挖掘任务中的关键问题,提高频繁项集的生成效率一直是数据挖掘领域研究的热点之一,研究人员从不同的角度对算法进行改进以提高算法的效率。文章通过集合的交集运算,得到一种新的频繁项集挖掘算法-SetFIS算法,该算法能快速、直观地求出事务数据库的频繁项集。

Mining the frequent itemsets is a key problem in data mining. Improving the efficiency of discovering the algorithms from different perspectives has been study focus. In this paper, an algorithm that SetFIS algorithm based on intersection operator of set. The frequent item sets of traction databases can be inducted quickly and intuitively.