Abstract
In this work, we propose an adjustable stepsize data-mining algorithm to discover adaptive-support association rules (ASAR) [Lin, B. et al., Jan. 2002] from data sets. Adaptive support association rules are constrained association rules with application to collaborative recommendation systems. To discover association rules for recommendation systems, minimum conference and a specific target item in association rules are usually assumed and no minimum support is specified in advance. Based on size monotonicity 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 iterative approach shows that our proposed technique requires less computation, both running time and iteration steps, and would always find a corresponding minimum support.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
