By Topic

A novel frequent pattern mining algorithm for very large databases in cloud computing environments

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
$33 $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)
Kawuu W. Lin ; Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan ; Pei-Ling Chen ; Weng-Long Chang

FP-growth is the most famous algorithm for discovering frequent patterns. As the database size growths or the minimum support decreases, however, both of the memory requirement and execution time increase greatly. Many researchers tried to solve this problem by utilizing distributed computing techniques to improve the scalability and execution efficiency. In this paper, we propose a method for discovering frequent patterns from very large database in cloud computing environments. To build the whole FP-Tree, we use the disk as the secondary memory. Because the disk access is much slower than main memory, an efficient data structure for storing and retrieving FP-Tree from disk is also proposed. Through empirical evaluations on various simulation conditions, the proposed method delivers excellent performance in terms of scalability and execution time.

Published in:

Granular Computing (GrC), 2011 IEEE International Conference on

Date of Conference:

8-10 Nov. 2011