Name
Abstract | ||
|---|---|---|
Discovering significant itemsets is one of the fundamental problems in data mining. It has recently been shown that constraint programming is a flexible way to tackle data mining tasks. With a constraint programming approach, we can easily express and efficiently answer queries with users constraints on items. However, in many practical cases it is possible that queries also express users constraints on the dataset itself. For instance, asking for a particular itemset in a particular part of the dataset. This paper presents a general constraint programming model able to handle any kind of query on the items or the dataset for itemset mining. |
Year | Venue | DocType |
|---|---|---|
2018 | CoRR | Journal |
Volume | Citations | PageRank |
abs/1801.00345 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Bessière | 1 | 1520 | 114.38 |
| Nadjib Lazaar | 2 | 36 | 12.25 |
| Yahia Lebbah | 3 | 115 | 19.34 |
| Mehdi Maamar | 4 | 0 | 0.34 |