default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbdelkader Ouali
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Arnold Hien
, Noureddine Aribi, Samir Loudni, Yahia Lebbah, Abdelkader Ouali, Albrecht Zimmermann:
Mining diverse sets of patterns with constraint programming using the pairwise Jaccard similarity relaxation. Constraints An Int. J. 29(1): 80-111 (2024)- [j6]Etienne Lehembre, Bruno Crémilleux, Albrecht Zimmermann, Bertrand Cuissart, Abdelkader Ouali:
WaveLSea: helping experts interactively explore pattern mining search spaces. Data Min. Knowl. Discov. 38(4): 2403-2439 (2024) - [c13]Djawad Bekkoucha, Abdelkader Ouali, Patrice Boizumault, Bruno Crémilleux:
Efficiently Mining Closed Interval Patterns with Constraint Programming. CPAIOR (1) 2024: 51-67 - [c12]Arnold Hien, Samir Loudni, Noureddine Aribi, Abdelkader Ouali, Albrecht Zimmermann:
Nouveaux Descripteurs Discriminants pour la Fouille Interactive de Motifs. EGC 2024: 409-416 - 2023
- [j5]Etienne Lehembre, Johanna Giovannini, Damien Geslin, Alban Lepailleur, Jean Luc Lamotte, David Auber, Abdelkader Ouali, Bruno Crémilleux, Albrecht Zimmermann, Bertrand Cuissart, Ronan Bureau:
Towards a partial order graph for interactive pharmacophore exploration: extraction of pharmacophores activity delta. J. Cheminformatics 15(1): 116 (2023) - [j4]Soufia Bennai, Kamal Amroun, Samir Loudni, Abdelkader Ouali:
An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints. J. Supercomput. 79(1): 650-676 (2023) - [c11]Etienne Lehembre, Bruno Crémilleux, Bertrand Cuissart, Abdelkader Ouali, Albrecht Zimmermann:
Wave k-Top d-Random Family Search : comment guider un expert dans un espace structuré. EGC 2023: 103-114 - [c10]Arnold Hien, Samir Loudni, Noureddine Aribi, Abdelkader Ouali, Albrecht Zimmermann:
Interactive Pattern Mining Using Discriminant Sub-patterns as Dynamic Features. PAKDD (1) 2023: 252-263 - [c9]Etienne Lehembre, Bruno Crémilleux, Bertrand Cuissart, Abdelkader Ouali, Albrecht Zimmermann:
Wave Top-k Random-d Family Search: How to Guide an Expert in a Structured Pattern Space. PKDD/ECML Workshops (3) 2023: 104-119 - 2022
- [c8]Etienne Lehembre, Jean Luc Lamotte, Christophe Couronne, Bruno Crémilleux, Jean-Luc Manguin, Bertrand Cuissart, Abdelkader Ouali, Albrecht Zimmermann:
Identification de concepts remarquables à partir de leur voisinage dans un treillis. EGC 2022: 473-474 - [c7]Etienne Lehembre, Ronan Bureau, Bruno Crémilleux, Bertrand Cuissart, Jean Luc Lamotte, Alban Lepailleur, Abdelkader Ouali, Albrecht Zimmermann:
Selecting Outstanding Patterns Based on Their Neighbourhood. IDA 2022: 185-198 - [i2]Soufia Bennai, Kamal Amroun, Samir Loudni, Abdelkader Ouali:
An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints. CoRR abs/2203.11208 (2022) - [i1]Arnold Hien, Samir Loudni, Noureddine Aribi, Abdelkader Ouali, Albrecht Zimmermann:
Exploiting complex pattern features for interactive pattern mining. CoRR abs/2204.04242 (2022) - 2020
- [j3]Abdelkader Ouali, David Allouche, Simon de Givry, Samir Loudni, Yahia Lebbah, Lakhdar Loukil, Patrice Boizumault:
Variable neighborhood search for graphical model energy minimization. Artif. Intell. 278 (2020) - [c6]Arnold Hien, Samir Loudni, Noureddine Aribi, Yahia Lebbah, Mohammed El Amine Laghzaoui, Abdelkader Ouali, Albrecht Zimmermann:
A Relaxation-Based Approach for Mining Diverse Closed Patterns. ECML/PKDD (1) 2020: 36-54
2010 – 2019
- 2018
- [c5]Noureddine Aribi, Abdelkader Ouali, Yahia Lebbah, Samir Loudni:
Equitable Conceptual Clustering Using OWA Operator. PAKDD (3) 2018: 465-477 - 2017
- [b1]Abdelkader Ouali:
Méthodes hybrides parallèles pour la résolution de problèmes d'optimisation combinatoire : application au clustering sous contraintes. (Parallel hybrid methods for solving combinatorial optimization problems : application to clustering under constraints). Normandy University, France, 2017 - [c4]Abdelkader Ouali, Albrecht Zimmermann, Samir Loudni, Yahia Lebbah, Bruno Crémilleux, Patrice Boizumault, Lakhdar Loukil:
Integer Linear Programming for Pattern Set Mining; with an Application to Tiling. PAKDD (2) 2017: 286-299 - [c3]Abdelkader Ouali, David Allouche, Simon de Givry, Samir Loudni, Yahia Lebbah, Lakhdar Loukil:
Iterative Decomposition Guided Variable Neighborhood Search for Graphical Model Energy Minimization. UAI 2017 - 2016
- [c2]Abdelkader Ouali, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Albrecht Zimmermann, Lakhdar Loukil:
Efficiently Finding Conceptual Clustering Models with Integer Linear Programming. IJCAI 2016: 647-654 - 2015
- [j2]Abdelkader Ouali, Samir Loudni, Lakhdar Loukil, Patrice Boizumault, Yahia Lebbah:
Replicated Parallel Strategies for Decomposition Guided VNS. Electron. Notes Discret. Math. 47: 93-100 (2015) - 2014
- [j1]Sofiane Boukli Hacene, Abdelkader Ouali, Asmaa Bassou:
Predictive preemptive certificate transfer in Cluster-Based Certificate Chain. Int. J. Commun. Networks Inf. Secur. 6(1) (2014) - [c1]Abdelkader Ouali, Samir Loudni, Lakhdar Loukil, Patrice Boizumault, Yahia Lebbah:
Cooperative Parallel Decomposition Guided VNS for Solving Weighted CSP. Hybrid Metaheuristics 2014: 100-114
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
