default search action
Samir Loudni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c48]François Camelin, Samir Loudni, Gilles Pesant, Charlotte Truchet:
Échantillonnage d'ensemble de motifs diversifiés par compression locale. EGC 2024: 83-94 - [c47]Arnold Hien, Samir Loudni, Maxime Garfagni, Albrecht Zimmermann, Nicolas Beldiceanu:
Fouille Interactive de Motifs à Haute Utilité. EGC 2024: 303-310 - [c46]Arnold Hien, Samir Loudni, Noureddine Aribi, Abdelkader Ouali, Albrecht Zimmermann:
Nouveaux Descripteurs Discriminants pour la Fouille Interactive de Motifs. EGC 2024: 409-416 - [c45]Charles Vernerey
, Noureddine Aribi
Learning to Rank Based on Choquet Integral: Application to Association Rules. PAKDD (1) 2024: 313-326 - 2023
- [j19]Nassim Belmecheri
Boosting the Learning for Ranking Patterns. Algorithms 16(5): 218 (2023) - [j18]Charles Vernerey
A Java Library for Itemset Mining with Choco-solver. J. Open Source Softw. 8(89): 5654 (2023) - [j17]Soufia Bennai
An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints. J. Supercomput. 79(1): 650-676 (2023) - [c44]Aymeric Beauchamp, Thi-Bich-Hanh Dao
Incremental Constrained Clustering by Minimal Weighted Modification. CP 2023: 10:1-10:22 - [c43]Charles Vernerey, Samir Loudni, Noureddine Aribi, Yahia Lebbah:
Fouille de motifs sans seuil par optimisation multi-objectifs : Application aux règles d'association. EGC 2023: 483-490 - [c42]Arnold Hien
Interactive Pattern Mining Using Discriminant Sub-patterns as Dynamic Features. PAKDD (1) 2023: 252-263 - 2022
- [c41]Nassim Belmecheri, Noureddine Aribi, Nadjib Lazaar, Yahia Lebbah, Samir Loudni:
Une méthode d'apprentissage par optimisation multicritère pour le rangement de motifs en fouille de données. EGC 2022: 289-296 - [c40]Charles Vernerey, Samir Loudni, Noureddine Aribi
Threshold-free Pattern Mining Meets Multi-Objective Optimization: Application to Association Rules. IJCAI 2022: 1880-1886 - [i9]Nassim Belmecheri, Noureddine Aribi, Nadjib Lazaar, Yahia Lebbah, Samir Loudni:
Boosting the Learning for Ranking Patterns. CoRR abs/2203.02696 (2022) - [i8]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) - [i7]Arnold Hien
Exploiting complex pattern features for interactive pattern mining. CoRR abs/2204.04242 (2022) - 2020
- [j16]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) - [c39]Soufia Bennai, Kamal Amroun, Samir Loudni:
Exploitation des techniques de fouille de données pour la compression de contraintes table. EGC 2020: 449-456 - [c38]Arnold Hien
A Relaxation-Based Approach for Mining Diverse Closed Patterns. ECML/PKDD (1) 2020: 36-54
2010 – 2019
- 2019
- [c37]Noureddine Aribi
A Multiple Fault Localization Approach Based on Multicriteria Analytical Hierarchy Process. AITest 2019: 1-8 - [c36]Soufia Bennai, Kamal Amroun
Exploiting Data Mining Techniques for Compressing Table Constraints. ICTAI 2019: 42-49 - [c35]Willy Ugarte
Compressing and Querying Skypattern Cubes. IEA/AIE 2019: 406-421 - 2018
- [j15]Amina Kemmar, Yahia Lebbah, Samir Loudni:
Interval graph mining. Int. J. Data Min. Model. Manag. 10(1): 1-22 (2018) - [c34]Noureddine Aribi, Abdelkader Ouali, Yahia Lebbah, Samir Loudni:
Equitable Conceptual Clustering Using OWA Operator. PAKDD (3) 2018: 465-477 - 2017
- [j14]Willy Ugarte
Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems. Artif. Intell. 244: 48-69 (2017) - [j13]Mehdi Maamar, Nadjib Lazaar
Fault localization using itemset mining under constraints. Autom. Softw. Eng. 24(2): 341-368 (2017) - [j12]Amina Kemmar, Yahia Lebbah
Prefix-projection global constraint and top-k approach for sequential pattern mining. Constraints An Int. J. 22(2): 265-306 (2017) - [c33]Noureddine Aribi
Multiple Fault Localization Using Constraint Programming and Pattern Mining. ICTAI 2017: 860-867 - [c32]Abdelkader Ouali
Integer Linear Programming for Pattern Set Mining; with an Application to Tiling. PAKDD (2) 2017: 286-299 - [c31]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
- [b1]Samir Loudni:
Contributions à la résolution des WCSP et approches déclaratives pour la fouille de données. University of Caen Normandy, France, 2016 - [j11]David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Jimmy H. M. Lee, Ka Lun Leung, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex
Tractability-preserving transformations of global cost functions. Artif. Intell. 238: 166-189 (2016) - [j10]Amina Kemmar, Yahia Lebbah, Samir Loudni:
A Constraint Programming Approach for Web Log Mining. Int. J. Inf. Technol. Web Eng. 11(4): 24-42 (2016) - [j9]Amina Kemmar, Yahia Lebbah, Samir Loudni, Patrice Boizumault, Thierry Charnois
Une contrainte globale pour l'extraction de motifs séquentiels. Rev. d'Intelligence Artif. 30(6): 675-703 (2016) - [c30]Nadjib Lazaar
A Global Constraint for Closed Frequent Pattern Mining. CP 2016: 333-349 - [c29]Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois
A Global Constraint for Mining Sequential Patterns with GAP Constraint. CPAIOR 2016: 198-215 - [c28]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 - [i6]Mehdi Maamar, Nadjib Lazaar
A global constraint for closed itemset mining. CoRR abs/1604.04894 (2016) - 2015
- [j8]Abdelkader Ouali
Replicated Parallel Strategies for Decomposition Guided VNS. Electron. Notes Discret. Math. 47: 93-100 (2015) - [j7]Willy Ugarte
Soft constraints for pattern mining. J. Intell. Inf. Syst. 44(2): 193-221 (2015) - [c27]Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois
PREFIX-PROJECTION Global Constraint for Sequential Pattern Mining. CP 2015: 226-243 - [c26]Willy Ugarte
Modeling and Mining Optimal Patterns Using Dynamic CSP. ICTAI 2015: 33-40 - [i5]David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Jimmy H. M. Lee, Ka Lun Leung, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex, Yi Wu:
Tractability and Decompositions of Global Cost Functions. CoRR abs/1502.02414 (2015) - [i4]Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois:
Prefix-Projection Global Constraint for Sequential Pattern Mining. CoRR abs/1504.07877 (2015) - [i3]Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois:
A global Constraint for mining Sequential Patterns with GAP constraint. CoRR abs/1511.08350 (2015) - 2014
- [c25]Willy Ugarte Rojas
Mining (Soft-) Skypatterns Using Dynamic CSP. CPAIOR 2014: 71-87 - [c24]Willy Ugarte
Computing Skypattern Cubes. ECAI 2014: 903-908 - [c23]Jean-Philippe Métivier, Samir Loudni, Thierry Charnois:
Une approche PPC pour la fouille de données séquentielles. EGC 2014: 395-400 - [c22]Abdelkader Ouali
Cooperative Parallel Decomposition Guided VNS for Solving Weighted CSP. Hybrid Metaheuristics 2014: 100-114 - [c21]Amina Kemmar, Willy Ugarte
Mining Relevant Sequence Patterns with CP-Based Framework. ICTAI 2014: 552-559 - [c20]Willy Ugarte
Computing Skypattern Cubes Using Relaxation. ICTAI 2014: 859-866 - 2013
- [j6]Mathieu Fontaine, Samir Loudni, Patrice Boizumault:
Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS. RAIRO Oper. Res. 47(2): 91-123 (2013) - [c19]Willy Ugarte
Mining (Soft-) Skypatterns Using Constraint Programming. EGC (best of volume) 2013: 105-136 - [c18]Willy Ugarte, Patrice Boizumault, Samir Loudni, Bruno Crémilleux, Alban Lepailleur:
Découverte des soft-skypatterns avec une approche PPC. EGC 2013: 217-228 - [c17]Samir Loudni, Mathieu Fontaine, Patrice Boizumault:
Intensification/Diversification in Decomposition Guided VNS. Hybrid Metaheuristics 2013: 22-36 - [i2]Jean-Philippe Métivier, Samir Loudni, Thierry Charnois
A Constraint Programming Approach for Mining Sequential Patterns in a Sequence Database. CoRR abs/1311.6907 (2013) - 2012
- [j5]Samir Loudni, Mathieu Fontaine, Patrice Boizumault:
Exploiting Separators for Guiding VNS. Electron. Notes Discret. Math. 39: 265-272 (2012) - [c16]David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex:
Filtering Decomposable Global Cost Functions. AAAI 2012: 407-413 - [c15]Willy Ugarte
Soft Threshold Constraints for Pattern Mining. Discovery Science 2012: 313-327 - [c14]Samir Loudni:
Intensification/Diversification-Driven ILS for a Graph Coloring Problem. EvoCOP 2012: 160-171 - [c13]Amina Kemmar, Yahia Lebbah, Mohammed Ouali, Samir Loudni:
Complete and Incomplete Approaches for Graph Mining. ICWIT 2012: 312-317 - [c12]Jean-Philippe Métivier, Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, Samir Loudni:
Constrained Clustering Using SAT. IDA 2012: 207-218 - [c11]Jean-Philippe Métivier, Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, Samir Loudni:
A constraint language for declarative pattern discovery. SAC 2012: 119-125 - 2011
- [c10]Jean-Philippe Métivier, Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, Samir Loudni:
A Constraint-Based Language for Declarative Pattern Discovery. ICDM Workshops 2011: 1112-1119 - [c9]Mathieu Fontaine, Samir Loudni, Patrice Boizumault:
Guiding VNS with Tree Decomposition. ICTAI 2011: 505-512 - [i1]Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, Samir Loudni, Jean-Philippe Métivier:
Discovering Knowledge using a Constraint-based Language. CoRR abs/1107.3407 (2011) - 2010
- [j4]Samir Loudni, Patrice Boizumault, Nicolas Levasseur:
Advanced generic neighborhood heuristics for VNS. Eng. Appl. Artif. Intell. 23(5): 736-764 (2010)
2000 – 2009
- 2009
- [c8]Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni:
Solving Nurse Rostering Problems Using Soft Global Constraints. CP 2009: 73-87 - [c7]Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni:
Softening Gcc and Regular with preferences. SAC 2009: 1392-1396 - 2008
- [j3]Samir Loudni, Patrice Boizumault:
Combining VNS with constraint programming for solving anytime optimization problems. Eur. J. Oper. Res. 191(3): 705-735 (2008) - [c6]Nicolas Levasseur, Patrice Boizumault, Samir Loudni:
Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems. Hybrid Metaheuristics 2008: 131-145 - 2007
- [c5]Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni:
All Different: Softening AllDifferent in Weighted CSPs. ICTAI (1) 2007: 223-230 - [c4]Nicolas Levasseur, Patrice Boizumault, Samir Loudni:
A Value Ordering Heuristic for Weighted CSP. ICTAI (1) 2007: 259-262 - 2006
- [j2]Samir Loudni, Patrice Boizumault, Philippe David:
On-line resources allocation for ATM networks with rerouting. Comput. Oper. Res. 33(10): 2891-2917 (2006) - 2003
- [j1]Patrice Boizumault, Philippe David, Samir Loudni:
Réservation en ligne avec reroutage de demandes de connexion dans les réseaux ATM. Tech. Sci. Informatiques 22(1): 169-182 (2003) - [c3]Samir Loudni, Patrice Boizumault:
Solving Constraint Optimization Problems in Anytime Contexts. IJCAI 2003: 251-256 - [c2]Samir Loudni, Patrice Boizumault, Philippe David:
Réservation en ligne avec reroutage de demandes de connexion dans les réseaux ATM. JFPLC 2003: 169-182 - 2001
- [c1]Samir Loudni, Patrice Boizumault:
A New Hybrid Method for Solving Constraint Optimization Problems in Anytime Contexts. ICTAI 2001: 325-332
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 2024-11-08 21:28 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: