PGLCM: efficient parallel mining of closed frequent gradual itemsets

Trong Dinh Thac Do (1) , Alexandre Termier (2) , Anne Laurent (3) , Benjamin Negrevergne (4) , Behrooz Omidvar Tehrani (1) , Sihem Amer-Yahia (5)

1 LIG - Laboratoire d'Informatique de Grenoble
2 IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires
3 WEB3 - WEB Architecture x Semantic WEB x WEB of Data
4 MESCAL - Middleware efficiently scalable
5 SLIDE - ScaLable Information Discovery and Exploitation [Saint Martin d’Hères]

Numerical data (e.g., DNA micro-array data, sensor data) pose a challenging problem to existing frequent pattern mining methods which hardly handle them. In this framework, gradual patterns have been recently proposed to extract covariations of attributes, such as: “When X increases, Y decreases”. There exist some algorithms for mining frequent gradual patterns, but they cannot scale to real-world databases. We present in this paper GLCM, the first algorithm for mining closed frequent gradual patterns, which proposes strong complexity guarantees: the mining time is linear with the number of closed frequent gradual itemsets. Our experimental study shows that GLCM is two orders of magnitude faster than the state of the art, with a constant low memory usage. We also present PGLCM, a parallelization of GLCM capable of exploiting multicore processors, with good scale-up properties on complex datasets. These algorithms are the first algorithms capable of mining large real world datasets to discover gradual patterns.

Mots clés: Parallelism; Data mining; Frequent pattern mining; Gradual itemsets

Domaines: Base de données [cs.DB]

Trong Dinh Thac Do, Alexandre Termier, Anne Laurent, Benjamin Negrevergne, Behrooz Omidvar Tehrani, et al.. PGLCM: efficient parallel mining of closed frequent gradual itemsets. Knowledge and Information Systems (KAIS), 2015, 43 (3), pp.497-527. ⟨10.1007/s10115-014-0749-8⟩. ⟨lirmm-01381085⟩