Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/5982
Title: | Task-parallel FP-growth on cluster computers | Authors: | Özdoğan, Gülistan Özdemir Abul, O. |
Source: | 25th International Symposium on Computer and Information Sciences, ISCIS 2010, 22 September 2010 through 24 September 2010, London, 82255 | Abstract: | Frequent itemset mining (FIM) is one of the most deeply studied data mining task. A number of algorithms, employing different approaches and advanced data structures, have already been proposed to solve the task efficiently. Even the fastest serial FIM algorithms fail to scale up with the rapid growth of database sizes. Hence, parallel FIM algorithms are the only viable solutions in many domains as serial solutions have almost reached the physical barriers. To this end, parallel versions of a few serial FIM algorithms, including FP-Growth, have already been developed. In this study, we develop three different parallel FP-Growth implementations for cluster computers. They, all MPI based, are (i) Static Parallel FP-Growth, (ii) Dynamic Parallel FP-Growth, and (iii) (Tree-Sharing) Dynamic Parallel FP-Growth. All the three variants are task-parallel, i.e., not based on horizontal or vertical partitioning of database. The algorithms are experimentally evaluated on a 16-node cluster computer. Our results demonstrate the utility of the algorithms. © 2011 Springer Science+Business Media B.V. | URI: | https://doi.org/10.1007/978-90-481-9794-1_71 https://hdl.handle.net/20.500.11851/5982 |
ISBN: | 9789048197934 | ISSN: | 1876-1100 |
Appears in Collections: | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
4
checked on Sep 7, 2024
Page view(s)
82
checked on Sep 2, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.