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

An Algorithm for Mining Frequent Itemsets Based on Associated Matrix

根据经典Apriori性质和算法思想,提出了一种基于关联矩阵的挖掘频繁项集的算法.应用实例分析表明,该算法在挖掘过程中,只需扫描一次数据库,有效地减少了扫描数据库的次数,提高了算法的效率.

According to the ideas and properties of the classical Apriori algorithm, a new algorithm for mining frequent itemsets is proposed, which is based on the associated matrix. Through the analysis of the example, it has been found that this algorithm scans the ＇database only for one time and reduces the number of scanning during the mining process, and improves the efficiency of the algorithm.