18 citations · 45 across the 10 of their papers we have counts for
10 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…
Exploiting complex pattern features for interactive pattern mining
Arnold Hien, Samir Loudni, Noureddine Aribi +2
Recent years have seen a shift from a pattern mining process that has users define constraints before-hand, and sift through the results afterwards, to an interactive one. This new…
An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints
Soufia Bennai, Kamala Amroun, Samir Loudni +1
Constraint Programming is a powerful paradigm to model and solve combinatorial problems. While there are many kinds of constraints, the table constraint is perhaps the most signifi…
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…
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…
Tractability and Decompositions of Global Cost Functions
David Allouche, Christian Bessiere, Patrice Boizumault +8
Enforcing local consistencies in cost function networks is performed by applying so-called Equivalent Preserving Transformations (EPTs) to the cost functions. As EPTs transform the…
A Constraint Programming Approach for Mining Sequential Patterns in a Sequence Database
Jean-Philippe Métivier, Samir Loudni, Thierry Charnois
Constraint-based pattern discovery is at the core of numerous data mining tasks. Patterns are extracted with respect to a given set of constraints (frequency, closedness, size, etc…
Discovering Knowledge using a Constraint-based Language
Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari +2
Discovering pattern sets or global patterns is an attractive issue from the pattern mining community in order to provide useful information. By combining local patterns satisfying…