ParaMiner: a Generic Pattern Mining Algorithm for Multi-Core Architectures

Abstract : In this paper, we present Para Miner which is a generic and parallel algorithm for closed pattern mining. Para Miner is built on the principles of pattern enumeration in strongly accessible set systems. Its efficiency is due to a novel dataset reduction technique (that we call EL-reduction), combined with novel technique for performing dataset reduction in a parallel execution on a multi-core architecture. We illustrate Para Miner's genericity by using this algorithm to solve three different pattern mining problems: the frequent itemset mining problem, the mining frequent connected relational graphs problem and the mining gradual itemsets problem. In this paper, we prove the soundness and the completeness of Para Miner. Furthermore, our experiments show that despite being a generic algorithm, Para Miner can compete with specialized state of the art algorithms designed for the pattern mining problems mentioned above. Besides, for the particular problem of gradual itemset mining, Para Miner outperforms the state of the art algorithm by two orders of magnitude.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00923535
Contributor : Alexandre Termier <>
Submitted on : Friday, January 3, 2014 - 3:33:19 PM
Last modification on : Thursday, February 7, 2019 - 2:51:47 PM

Identifiers

Citation

Benjamin Negrevergne, Alexandre Termier, Marie-Christine Rousset, Jean-François Mehaut. ParaMiner: a Generic Pattern Mining Algorithm for Multi-Core Architectures. Data Mining and Knowledge Discovery, Springer, 2014, 28 (3), pp.595-633. ⟨http://link.springer.com/article/10.1007%2Fs10618-013-0313-2⟩. ⟨10.1007/s10618-013-0313-2⟩. ⟨hal-00923535⟩

Share

Metrics

Record views

385