Skip to Main content Skip to Navigation
New interface
Journal articles

PGLCM: efficient parallel mining of closed frequent gradual itemsets

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : Anne Laurent Connect in order to contact the contributor
Submitted on : Monday, October 7, 2019 - 11:25:46 AM
Last modification on : Friday, August 5, 2022 - 3:03:27 PM


Files produced by the author(s)



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⟩



Record views


Files downloads