PARALLEL MINING OF FREQUENT MAXIMAL ITEMSETS USING ORDER PRESERVING GENERATORS
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, PO...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
ICT Academy of Tamil Nadu
2010-10-01
|
| Sarja: | ICTACT Journal on Soft Computing |
| Aiheet: | |
| Linkit: | http://ictactjournals.in/paper/ijsc1_page_63_69.pdf |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|