Title: A CSP for the Enumeration of Frequent-closed Patterns in Sequences

Year of Publication: 2015
Page Numbers: 59-63
Authors: RAJEB Akram, BEN HAMADOU Abdelmajid and LOUKIL Zied
Conference Name: The Second International Conference on Artificial Intelligence and Pattern Recognition (AIPR2015)
- China


In this paper, we propose a CSP-based encoding for the problem of discovering frequents and closed patterns in a sequence. We show that is possible to employee constraint programming techniques for modeling and solving a wide variety of constraint-based item-set mining tasks, such as frequent, closed and maximal. Preliminary experiments show that the new formulation is competitive and can outperform the SAT based approach on the considered sequences.