Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

An Efficient Algorithm for Discovering all Frequent Patterns

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)
Fuzan Chen ; Sch. of Manage., Tianjin Univ. Tianjin, Tianjin, China ; Minqiang Li ; Kou, J.

Discovering frequent patterns is one of the essential topic data mining. An efficient algorithm based on compressed bitmap and two-way-hybrid strategy is proposed. Firstly, a hierarchical search space organization is presented, based on which the original search space can be recursively decomposed into some smaller independent pieces. Secondly, a compressed bitmap index technique is employed to speed up the support counting. The original bitmap can be impacted efficiently by this way. Thirdly, a novel HFMI algorithm, which explores a flexible two-way-hybrid search method, is given. It can discovery both longer and shorter frequent patterns as many as possible. And experimental and analytical results are presented in the end of this paper.

Published in:

Intelligent Systems, 2009. GCIS '09. WRI Global Congress on  (Volume:2 )

Date of Conference:

19-21 May 2009