By Topic

Association rule mining: A graph based approach for mining frequent itemsets

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)
Tiwari, V. ; MITS, Deemed Univ., Sikar, India ; Tiwari, V. ; Gupta, S. ; Tiwari, R.

Most of studies for mining frequent patterns are based on constructing tree for arranging the items to mine frequent patterns. Many algorithms proposed recently have been motivated by FP-Growth (Frequent Pattern Growth) process and uses an FP-Tree (Frequent Pattern Tree) to mine frequent patterns. This paper introduces an algorithm called FP-Growth-Graph which uses graph instead of tree to arrange the items for mining frequent itemsets. The algorithm contains three main parts. The first is to scan the database only once for generating graph for all item. The second is to prune the non-frequent items based on given minimum support threshold and readjust the frequency of edges, and then construct the FP_graph. The benefit of using graph structure comes in the form of space complexity because graph uses an item as node exactly once rather than two or more times as was done in tree.

Published in:

Networking and Information Technology (ICNIT), 2010 International Conference on

Date of Conference:

11-12 June 2010