Towards more parallel frequent itemset mining algorithms. (English) Zbl 1157.68523
Zheng, S. Q. (ed.), Parallel and distributed computing systems. Proceedings of the 19th IASTED international conference (PDCS 2007), Cambridge, MA, USA, November 19–21, 2007. Calgary: International Association of Science and Technology for Development (IASTED); Anaheim, CA: Acta Press (ISBN 978-0-88986-704-8/CD-ROM). 97-103 (2007).
Summary: This paper presents improvements of the PARALLEL-FIMI method for statical load balancing of mining of all frequent itemsets on a distributed-memory (DM) parallel machine. This method probabilistically partitions the space of all frequent itemsets into partitions of approximately the same size. The improvements consist in paralelization of the approximate partitioning of the search space and of dynamic reordering of items during construction of prefixbased equivalence classes. The new versions of the method achieve nearly linear speedups up to 10 processors.
For the entire collection see [Zbl 1154.68030].
For the entire collection see [Zbl 1154.68030].
MSC:
| 68W10 | Parallel algorithms in computer science |
| 68P05 | Data structures |
| 68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |
