Name
Abstract | ||
|---|---|---|
In this paper, we propose a SAT-based encoding for the problem of discovering frequent, closed and maximal patterns in a sequence of items and a sequence of itemsets. Our encoding can be seen as an improvement of the approach proposed in [8] for the sequences of items. In this case, we show experimentally on real world data that our encoding is significantly better. Then we introduce a new extension of the problem to enumerate patterns in a sequence of itemsets. Thanks to the flexibility and to the declarative aspects of our SAT-based approach, an encoding for the sequences of itemsets is obtained by a very slight modification of that for the sequences of items. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2505515.2505577 | CIKM |
Keywords | DocType | Citations |
boolean satisfiability,slight modification,sequence mining,real world data,new extension,sat-based approach,sat-based encoding,declarative aspect,maximal pattern,data mining | Conference | 12 |
PageRank | References | Authors |
0.52 | 21 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saïd Jabbour | 1 | 175 | 12.44 |
| Lakhdar Sais | 2 | 859 | 65.57 |
| Yakoub Salhi | 3 | 137 | 22.77 |