An improved Apriori algorithm for association rules of mining

Abstract

Apriori -the classical association rules mining algorithm is a way to find out certain potential, regular knowledge from the massive ones. But there are two more serious defects in the data mining process. The first needs many times to scan the business database and the second will inevitably produce a large number of irrelevant candidate sets which seriously occupy the system resources. An improved method is introduced on the basic of the defects above. The improved algorithm only scans the database once, at the same time the discrete data and statistics related are completed, and the final one is to prune the candidate item sets according to the minimum supporting degree and the character of the frequent item sets. After analysis, the improved algorithm reduces the system resources occupied and improves the efficiency and quality.