On the Enumeration of Frequent Patterns in Sequences
Rajeb Akram, Ben Hamadou, Zied Loukil · International Conference on Artificial Intelligence · 2014
Sequence mining is the problem of discovering frequent patterns in sequences. Recently, a declarative approach is proposed to deal with this problem that consists to translate such problem into the enumeration of SAT models. In this paper, we propose to formulate such SAT encoding into a Constraints Programming Problem. Preliminary experiments shows that the new formulation is competitive and can outperform the SAT based approach on the considered sequences.