The New Algorithms of Weighted Association Rules based on Apriori and FP-Growth Methods

Abstract

In order to improve the frequent itemsets generated layer-wise efficiency, the paper uses the Apriori property to reduce the search space. FP-grow algorithm for mining frequent pattern steps mainly is divided into two steps: FP-tree and FP-tree to construct a recursive mining. Algorithm FP-Growth is to avoid the high cost of candidate itemsets generation, fewer, more efficient scanning. The paper puts forward the new algorithms of weighted association rules based on Apriori and FP-Growth methods. In the same support, this method is the most effective and stable maximum frequent itemsets mining capacity and minimum execution time. Through theoretical analysis and experimental simulation of the performance of the algorithm is discussed, it is proved that the algorithm is feasible and effective.

DOI : http://dx.doi.org/10.11591/telkomnika.v12i5.4770