By Topic

STBAR: a more efficient algorithm for association rule mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
De-chang Pi ; Coll. of Inf. Sci. & Technol., Nanjing Univ. of Aeronaut. & Astronaut., China ; Xiao-lin Qin ; Wang-feng Gu ; Ran Cheng

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.

Published in:

2005 International Conference on Machine Learning and Cybernetics  (Volume:3 )

Date of Conference:

18-21 Aug. 2005