Discovering Closed Frequent Itemsets on Multicore: Parallelizing Computations and Optimizing Memory Accesses - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Discovering Closed Frequent Itemsets on Multicore: Parallelizing Computations and Optimizing Memory Accesses

Résumé

The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient parallel algorithms to solve this problem, capable of efficiently harnessing the power of multicore processors that exists in our computers (notebooks as well as desktops). In this paper we present PLCMQS, a parallel algorithm based on the LCM algorithm, recognized as the most efficient algorithm for sequential discovery of closed frequent itemsets. We also present a simple yet powerfull parallelism interface based on the concept of Tuple Space, which allows an efficient dynamic sharing of the work. Thanks to a detailed experimental study, we show that PLCMQS is efficient on both on sparse and dense databases.
Fichier non déposé

Dates et versions

hal-00788879 , version 1 (15-02-2013)

Identifiants

Citer

Benjamin Negrevergne, Alexandre Termier, Jean-François Mehaut, Takeaki Uno. Discovering Closed Frequent Itemsets on Multicore: Parallelizing Computations and Optimizing Memory Accesses. Proceedings of HPCS (Intl. Conference on High Performance Computing and Simulation), Special Session on High Performnce Parallel and Distribuated Data Mining, 2010, Caen, France. pp.521-528, ⟨10.1109/HPCS.2010.5547082⟩. ⟨hal-00788879⟩
108 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More