A novel algorithm for mining maximal frequent gradual patterns

Kenmogne Edith Belise, Laurent Cabrel Tabueu Fotso, Clémentin Tayou Djamégni

Abstract: Highlights•A new algorithm called Maximal Strict Gradual itemsets Miner (MSGriteMiner).•It is based on an in-depth traversing of the search space in lexicographic order.•It uses new properties for characterizing maximal frequent gradual patterns.•It reduces the search space and the computational load of fundamental operations.•Complexity analysis show that MSGriteMiner is better than previous algorithms.•Various experiments carried out on well-known datasets show its effectiveness.