Descending Dimension Algorithm for Association Rules Based on SQL Calculation

Abstract

Apriori algorithm is a classical algorithm for association rules mining. But the algorithm must be connect repeatly and operate steps layer by layer to find frequent item sets. To overcome the shortcomings of Apriori algorithm, relational database language SQL is used proceed from the higher-order item sets and compute the support of item set to find frequent item sets in this paper. The solution process eliminates a large number of duplicate items produced by the connection from low-dimensional to high-dimensional in the traditional process. The calculation is simplified and efficiency improved.