5 citations · 8 across the 7 of their papers we have counts for
8 papers
Boosting the Learning for Ranking Patterns
Nassim Belmecheri, Noureddine Aribi, Nadjib Lazaar +2
Pattern mining is a valuable tool for exploratory data analysis, but identifying relevant patterns for a specific user is challenging. Various interestingness mea- sures have been…
Boosting the Learning for Ranking Patterns
Nassim Belmecheri, Noureddine Aribi, Nadjib Lazaar +2
Discovering relevant patterns for a particular user remains a challenging tasks in data mining. Several approaches have been proposed to learn user-specific pattern ranking functio…
Users Constraints in Itemset Mining
Christian Bessiere, Nadjib Lazaar, Yahia Lebbah +1
Discovering significant itemsets is one of the fundamental problems in data mining. It has recently been shown that constraint programming is a flexible way to tackle data mining t…
A global constraint for closed itemset mining
Mehdi Maamar, Nadjib Lazaar, Samir Loudni +1
Discovering the set of closed frequent patterns is one of the fundamental problems in Data Mining. Recent Constraint Programming (CP) approaches for declarative itemset mining have…
A global Constraint for mining Sequential Patterns with GAP constraint
Amina Kemmar, Samir Loudni, Yahia Lebbah +2
Sequential pattern mining (SPM) under gap constraint is a challenging task. Many efficient specialized methods have been developed but they are all suffering from a lack of generic…
Prefix-Projection Global Constraint for Sequential Pattern Mining
Amina Kemmar, Samir Loudni, Yahia Lebbah +2
Sequential pattern mining under constraints is a challenging data mining task. Many efficient ad hoc methods have been developed for mining sequential patterns, but they are all su…
On Testing Constraint Programs
Nadjib Lazaar, Arnaud Gotlieb, Lebbah Yahia
The success of several constraint-based modeling languages such as OPL, ZINC, or COMET, appeals for better software engineering practices, particularly in the testing phase. This p…
Revisiting the upper bounding process in a safe Branch and Bound algorithm
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel +1
Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce a new str…