vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff8bba030000006a0f000001000100 In this paper, we propose a parallel algorithm for mining maximal itemsets. We propose POP-MAX (Parallel Order Preserving MAXimal itemset algorithm), a fast and memory efficient parallel algorithm which enumerates all the maximal patterns concurrently and independently across several nodes. Also, POP-MAX uses an efficient maximality checking technique which determines the maximality of an itemset using less number of items. To enhance the load sharing among different nodes, we have used round robin strategy which achieves load balancing as high as 90%. We have also incorporated bit-vectors and numerous optimizations to reduce the memory consumption and overall running time of the algorithm. Our comprehensive experimental analyses involving both real and synthetic datasets show that our algorithm takes less memory and less running time than other maximal itemset mining algorithms.
R.V. Nataraj1,S. Selvan2
P.S.G. College of Technology, Tamil Nadu, India1,Alpha Engineering College, Tamil Nadu, India2
Data Mining, Closed Itemsets, Maximal Itemsets, Mining Methods
| January | February | March | April | May | June | July | August | September | October | November | December |
| 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| Published By :
ICTACT
Published In :
ICTACT Journal on Soft Computing
( Volume: 1 , Issue: 2 , Pages: 63 - 69 )
Date of Publication :
October 2010
Page Views :
417
Full Text Views :
3
|