By Topic

HybridMiner: Mining Maximal Frequent Itemsets Using Hybrid Database Representation Approach

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

2 Author(s)
Bashir, S. ; FAST, Nat. Univ. of Comput. & Emerging Sci., Islamabad ; Baig, A.R.

In this paper we present a novel hybrid (array-based layout and vertical bitmap layout) database representation approach for mining complete maximal frequent itemset (MFI) on sparse and large datasets. Our work is novel in terms of scalability, item search order and two horizontal and vertical projection techniques. We also present a maximal algorithm using this hybrid database representation approach. Different experimental results on real and sparse benchmark datasets show that our approach is better than previous state of art maximal algorithms

Published in:

9th International Multitopic Conference, IEEE INMIC 2005

Date of Conference:

24-25 Dec. 2005