By Topic

An Effective Algorithm Based on Association Graph and Matrix for Mining 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
$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

4 Author(s)
Haiwei Pan ; Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China ; Xiaolei Tan ; Qilong Han ; Guisheng Yin

Association rule mining is a very important research topic in the field of data mining. Discovering frequent itemsets is the key process in association rule mining. Traditional association rule algorithms adopt an iterative method, which requires very large calculations and a complicated transaction process. FAR (Feature Matrix Based Association Rules) algorithm solves this problem. However, FAR algorithm is not efficient when the value of the minimum support is small or the number of column of the feature matrix is very large. So we proposed a new algorithm (GMA) which based on association graph and matrix pruning to reduce the amount of candidate itemsets. Experimental results show that our algorithm is more efficient for different values of minimum support.

Published in:

Database Technology and Applications (DBTA), 2010 2nd International Workshop on

Date of Conference:

27-28 Nov. 2010