An Efficient Weighted Association Rules Mining Algorithm

Article Preview

Abstract:

Aiming at the problem that most of weighted association rules algorithm have not the anti-monotonicity, this paper presents a weighted support-confidence framework which supports anti-monotonicity. On this basis, Boolean weighted association rules algorithm and weighted fuzzy association rules algorithm are presented, which use pruning strategy of Apriori algorithm so as to improve the efficiency of frequent itemsets generated. Experimental results show that both algorithms have good performance.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1247-1250

Citation:

Online since:

July 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. Agrawal. Mining association rules between sets of items in large databases. Proc. of the ACM SIGMOD, Washington, DC, USA: ACM Press, 1993: 207-216.

DOI: 10.1145/170036.170072

Google Scholar

[2] Tao, F., Murtagh, F., Farid, M. Weighted association rule mining using weighted support and significance framework. Proc. of 9th ACM SIGKDD, Washington, DC, USA: ACM Press, 2003: 661-666.

DOI: 10.1145/956750.956836

Google Scholar

[3] Wang, W., Yang, J, Yu, P.S. Efficient mining of weighted association rules(WAR). Proc. of the KDD, Boston, MA, 2000: 270-274.

Google Scholar

[4] Cai, C.H., Fu, A. W-C., Cheng, C.H., Kwong, W.W. Mining association rules with weighted items. Proc. of 1998 Intl. Database Engineering and applications symposium, Cardiff, Wales, UK, 1998: 68-77.

DOI: 10.1109/ideas.1998.694360

Google Scholar