Mining association rules: Anti-skew algorithms

Mining association rules among items in a large database has been recognized as one of the most important data mining problems. All proposed approaches for this problems require scanning the entire database at least or almost twice in the works case. In this paper we propose several techniques which overcome the problem of data skew in the basket data. These techniques reduce the maximum number of scans to less than 2, and in most cases find all association rules in about 1 scan. Our algorithms employ prior knowledge collected during the mining process and/or via sampling, to further reduce the number of candidate item-sets and identify false candidate itemsets at an earlier stage.