By Topic

Vertical Mining of Frequent Patterns Using Diffset Groups

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)
El-Megid, L. ; Dept. of Inf. Syst., Helwan Univ., Cairo, Egypt ; El-Sharkawi, M.E. ; El-Fangary, L.M. ; Helmy, Y.K.

Frequent patterns discovery is a core functionality used in many mining tasks and large broad application. In this paper, we present a new algorithm, VMUDG, for vertical mining of frequent itemsets. The proposed algorithm adapts a new efficient approach that classifies all frequent 2-itemsets into separate groups according to their diffsets. Using these groups, the proposed algorithm offers three new distinct features; First, it allows calculating the support of N itemsets (N is > 0) using one calculation process rather than N calculation processes. Second, it offers a chance to reduce the time needed for the manipulation of the itemsets diffsets. Third, it minimizes the need for checking the frequency condition for every itemset. A performance study of the proposed algorithm has been conducted. Several experiments show that the algorithm outperforms the well known dEclat algorithm.

Published in:

Intelligent Systems Design and Applications, 2009. ISDA '09. Ninth International Conference on

Date of Conference:

Nov. 30 2009-Dec. 2 2009