Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Lebbah, Yahia"'
Discovering relevant patterns for a particular user remains a challenging tasks in data mining. Several approaches have been proposed to learn user-specific pattern ranking functions. These approaches generalize well, but at the expense of the runnin
Externí odkaz:
http://arxiv.org/abs/2203.02696
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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 an
Externí odkaz:
http://arxiv.org/abs/1801.00345
Discovering the set of closed frequent patterns is one of the fundamental problems in Data Mining. Recent Constraint Programming (CP) approaches for declarative itemset mining have proven their usefulness and flexibility. But the wide use of reified
Externí odkaz:
http://arxiv.org/abs/1604.04894
Sequential pattern mining (SPM) under gap constraint is a challenging task. Many efficient specialized methods have been developed but they are all suffering from a lack of genericity. The Constraint Programming (CP) approaches are not so effective b
Externí odkaz:
http://arxiv.org/abs/1511.08350
Sequential pattern mining under constraints is a challenging data mining task. Many efficient ad hoc methods have been developed for mining sequential patterns, but they are all suffering from a lack of genericity. Recent works have investigated Cons
Externí odkaz:
http://arxiv.org/abs/1504.07877
Publikováno v:
Aircraft Engineering and Aerospace Technology, 2020, Vol. 92, Issue 8, pp. 1225-1243.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/AEAT-04-2019-0080
Autor:
Ouali, Abdelkader, Allouche, David, de Givry, Simon, Loudni, Samir, Lebbah, Yahia, Loukil, Lakhdar, Boizumault, Patrice
Publikováno v:
In Artificial Intelligence January 2020 278
Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce a new strategy to compute very accurate approximations of feasible points. This
Externí odkaz:
http://arxiv.org/abs/0807.2382
Fouille de motifs sans seuil par optimisation multi-objectifs : Application aux règles d'association
Publikováno v:
Revue des Nouvelles Technologies de l'Information
EGC 2023 : 23ème conférence francophone sur l'extraction et la gestion des connaissances
EGC 2023 : 23ème conférence francophone sur l'extraction et la gestion des connaissances, Jan 2023, Lyon, France. pp.483--490
EGC 2023 : 23ème conférence francophone sur l'extraction et la gestion des connaissances
EGC 2023 : 23ème conférence francophone sur l'extraction et la gestion des connaissances, Jan 2023, Lyon, France. pp.483--490
National audience; Cet article propose un nouveau modèle pour extraire les motifs Pareto dominants à l'aide de la programmation par contraintes. Notre modèle exploite le principe de la représentation condensée pour réduire l'espace de recherche
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::de43047e4574eecd8a6da62883ffade9
https://hal.science/hal-04042605/document
https://hal.science/hal-04042605/document