By Topic

An Adaptive Method for Discovering Maximal Frequent Itemsets to Large Databases

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

3 Author(s)

A novel adaptive method included two phases for discovering maximal frequent itemsets is proposed. A flexible hybrid search method is given, which exploits key advantages of both the top-down strategy and the bottomup strategy. Information gathered in the bottom-up can be used to prune in the other top-down direction. Some efficient decomposition and pruning strategies are implied, which can reduce the original search space rapidly in the iterations. The compressed bitmap technique is employed in the counting of itemsets support. According to the big space requirement for the saving of intact bitmap, each bit vector is partitioned into some blocks, and hence every bit block is encoded as a shorter symbol. Therefore the original bitmap is impacted efficiently. Experimental and analytical results are presented in the end.

Published in:

Advances in Recent Technologies in Communication and Computing (ARTCom), 2010 International Conference on

Date of Conference:

16-17 Oct. 2010