By Topic

A High Performance Algorithm for Mining Frequent Patterns: LPS-Miner

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

4 Author(s)
Xiaoyun Chen ; Sch. of Inf. Sci. & Eng., Lanzhou Univ., Lanzhou ; Huiling Liu ; Pengfei Chen ; Longjie Li

In this paper, we present a novel frequent pattern mining algorithm, called LPS-Miner, which bases the pattern growth principle and uses two new data structures, LPS-FP-Tree (Light Partial-Support FP-Tree) and LPS-Forest (Light Partial-Support FP-Tree Forest) to present the database. LPS-FP-Tree is a variation of FP-Tree with lighter unidirectional nodes and the mining process depends on the partial-support of the patterns. LPS-Miner adopts partition and divide-and-conquer strategies in maximum, which decomposes the mining task into a set of smaller tasks. The light data structure and efficient memory management mechanism keep the memory usage stable and efficient. Other implementation-based optimizations, such as pruning and outputting-optimization, make the algorithm achieve high efficiency. We test our c++ implementation of this algorithm versus several other algorithms on four datasets. The experimental results show that our algorithm has better space and time efficiency.

Published in:

2008 International Symposium on Information Science and Engineering  (Volume:2 )

Date of Conference:

20-22 Dec. 2008