I2Apriori: An improved apriori algorithm based on infrequent count

Shyam Kumar Singh, Preetham Kumar · 2016

In this paper, the proposed method reduces CPU computation time by reducing transaction scan. The Concept infrequent count is based on minimum threshold support and 2-way searching to reduce execution time during scanning of transaction is introduced in proposed method. There exist several data mining algorithms for finding association rules but one of the candidate generation algorithms named Apriori algorithm is considered for the proposed work.

Read the paper · More papers on PaperTik