By Topic

Multi-level Fuzzy Association Rules Mining via Determining Minimum Supports and Membership Functions

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
$31 $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

5 Author(s)
Mahmoudi, E.V. ; Mashhad Branch, Young Res. Club, Islamic Azad Univ., Mashhad, Iran ; Sabetnia, E. ; Torshiz, M.N. ; Jalali, M.
more authors

Association rule mining is sought for items through a fairly large data set relation are certainly consequential. The traditional association mining based on a uniform minimum support, either missed interesting patterns of low support or suffered from the bottleneck of item set generation. An alternative solution relies on exploiting support constraints which specifies the required minimum support itemsets. This paper proposes an ACS-based algorithm to determine membership functions for each item followed by computing minimum supports. It therefore will run the fuzzy multi-level mining algorithm for extracting knowledge implicit in quantitative transactions, immediately. In order to address this need, the new approach can express three profits includes specifying the membership functions for each items, computing the minimum support for each item regarding to characteristic for each item in database and making a system automation. We considered an algorithm that can cover the multiple level association rules under multiple item supports, significantly.

Published in:

Intelligent Systems, Modelling and Simulation (ISMS), 2011 Second International Conference on

Date of Conference:

25-27 Jan. 2011