This paper introduces the Apriori algorithm, and optimizes the Apriori algorithm from two aspects: gradually reducing the amount of data to be scanned and reducing the number of times the database is scanned. It also introduces the AprioriTid algorithm and the Partition algorithm. Based on the advantages of these two algorithms, the two algorithms are combined. The Partition algorithm is used for the entire database, the database is partitioned, and the AprioriTid algorithm is used in each partition. In addition, when partitioning the database, the data is preprocessed, that is, two sets with higher support numbers are placed in the same partition as much as possible. Finally, the combined result is compared with the efficiency of using only one algorithm.
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore