GEQCA: Generic Qualitative Constraint Acquisition

Autor: Mohamed-Bachir Belaid, Nassim Belmecheri, Arnaud Gotlieb, Nadjib Lazaar, Helge Spieker

Publikováno v: Proceedings of the AAAI Conference on Artificial Intelligence. 36:3690-3697

Many planning, scheduling or multi-dimensional packing problems involve the design of subtle logical combinations of temporal or spatial constraints. On the one hand, the precise modelling of these constraints, which are formulated in various relatio

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::fc5c24dbba7f3daf4af67df79b0d54e8
https://doi.org/10.1609/aaai.v36i4.20282

Constraint Programming for Mining Borders of Frequent Itemsets

Autor: Mohamed-Bachir Belaid, Nadjib Lazaar, Christian Bessiere

Publikováno v: 28th International Joint Conference on Artificial Intelligence
IJCAI: International Joint Conference on Artificial Intelligence
IJCAI: International Joint Conference on Artificial Intelligence, Aug 2019, Macao, China. pp.1064-1070, ⟨10.24963/ijcai.2019/149⟩
IJCAI 2019-28th International Joint Conference on Artificial Intelligence
IJCAI 2019-28th International Joint Conference on Artificial Intelligence, Aug 2019, Macao, China. pp.1064-1070, ⟨10.24963/ijcai.2019/149⟩
Scopus-Elsevier
IJCAI

International audience; Frequent itemset mining is one of the most studied tasks in knowledge discovery. It is often reduced to mining the positive border of frequent itemsets, i.e. maximal frequent itemsets. Infrequent itemset mining, on the other h

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70eed756edf8a2489ccb37ed095ecfcb
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02310629/file/ijcai19.pdf