11 citations · 11 across the 1 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2016
A SAT model to mine flexible sequences in transactional datasets
Rémi Coletta, Benjamin Negrevergne
Traditional pattern mining algorithms generally suffer from a lack of flexibility. In this paper, we propose a SAT formulation of the problem to successfully mine frequent flexible…
cs.AI2015★ 11 cited
Constraint-based sequence mining using constraint programming
Benjamin Negrevergne, Tias Guns
The goal of constraint-based sequence mining is to find sequences of symbols that are included in a large number of input sequences and that satisfy some constraints specified by t…