By Topic

Improving Frequent Itemset Mining Algorithms Performance Using Efficient Implementation Techniques: A Benchmark Solution

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)
Bashir, S. ; Nat. Univ. of Comput. & Emerging Sci. ; Shuaib, M. ; Sultan, Y. ; Baig, A.R.

Mining frequent itemset in transactional datasets is considered to be a very challenging research oriented task in data mining due to its large applicability in real world problems. Due to the NP-complete nature of problem, the efficiency of frequent itemset mining highly depends on the efficiency of algorithm implementation. In this paper we propose a number of different implementation techniques (other than itemset mining) strategy), that can improve the running time of any frequent itemset algorithm implementation. To check the efficiency of these implementation techniques we integrate them into the original implementations of current best itemset mining implementations. We also perform our computational experiments with our modified implementations on different spare and dense benchmark datasets, which show very good results

Published in:

Emerging Technologies, 2006. ICET '06. International Conference on

Date of Conference:

13-14 Nov. 2006