Skip to Main Content
The discovery of association rules is an important data-mining task for which many algorithms have been proposed. However, the efficiency of these algorithms needs to be improved to handle large datasets. In this paper, we present an algorithm named STBAR for mining association rules, which is improved from TBAR. STBAR employs dynamic pruning, which can effectively cut down the infrequent concatenations. Experiments with UCI dataset show that STBAR is more efficient in speed about 10%-30% than TBAR, which outperforms Apriori, a famous and widely used algorithm.