By Topic

An effective algorithm for mining association rules based on imperialist competitive algorithm

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

1 Author(s)
Khademolghorani, F. ; Dept. of Comput. Eng., Islamic Azad Univ., Isfahan, Iran

Association rule mining is one of the most applicable techniques in data mining, which includes two stages. The first is to find the frequent itemsets; the second is to use them to generate association rules. A lot of algorithms have been introduced for discovering these rules. Most of the previous algorithms mine occurrence rules, which are not interesting and readable for the users. In this paper, we propose a new efficient algorithm for exploring high-quality association rules by improving the imperialist competitive algorithm. The proposed method mine interesting and understandable association rules without relying upon the minimum support and the minimum confidence thresholds in only single run. The algorithm is evaluated with several experiments, and the results indicate the efficiency of our method.

Published in:

Digital Information Management (ICDIM), 2011 Sixth International Conference on

Date of Conference:

26-28 Sept. 2011