基于矩阵的频繁项集挖掘算法

A New Algorithm Based on Matrix to Mine Frequent Item Sets

在所有频繁项集挖掘算法中,Apriori算法一直是一个经典的算法,但是该算法存在的最大缺陷是要进行多次的数据库扫描并且在挖掘过程中产生大量的候选频繁项集,因此效率很低.提出了利用基于矩阵的方法挖掘频繁项集,很好地避免了这个缺陷.

Apriori algorithm has been considered as a classic algorithm to mine frequent item sets. But its major defect is that the database has to be scanned many times, and there are a large number of candidate item sets in the result. So this algorithm is inefficient. This research proposes a new algorithm based on matrix to mine frequent item sets and it can help overcome such defect.