By Topic

Efficient generation of Adaptive-Support Association Rules

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)
Shyue-Liang Wang ; Dept. of Comput. Sci., New York Inst. of Tech., NY, USA ; Mei-Hwa Wang ; Wen-Yang Lin ; Tzung-Pei Hong

We propose here an efficient data-mining algorithm to discover Adaptive-Support Association Rules (ASAR) from databases. Adaptive-support association rules are constrained association rules with application to collaborative recommendation systems. To discover association rules for recommendation systems, a specific value of target item in association rules is usually assumed and no minimum support is specified in advance. Based on size monotonocity of association rules, i.e., the number of association rules decreases when the minimum support increases, an efficient algorithm using adjustable step size for finding minimum support and therefore adaptive-support association rules is presented. Experimental comparison with the fixed step size adjustment approach shows that our proposed technique requires less computation, both running time and iteration steps, and will always find a corresponding minimum support.

Published in:

Systems, Man and Cybernetics, 2003. IEEE International Conference on  (Volume:1 )

Date of Conference:

5-8 Oct. 2003