Samir Loudni

Mohammed El Amine Laghzaoui

J. Open Source Softw., September, 2023

An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints.

[BibT_eX]

[DOI]

J. Supercomput., 2023

Boosting the Learning for Ranking Patterns.

[BibT_eX]

[DOI]

Algorithms, 2023

Interactive Pattern Mining Using Discriminant Sub-patterns as Dynamic Features.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2023

Fouille de motifs sans seuil par optimisation multi-objectifs : Application aux règles d'association.

[BibT_eX]

[DOI]

Proceedings of the Extraction et Gestion des Connaissances, 2023

Incremental Constrained Clustering by Minimal Weighted Modification.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022

Exploiting complex pattern features for interactive pattern mining.

[BibT_eX]

[DOI]

CoRR, 2022

Threshold-free Pattern Mining Meets Multi-Objective Optimization: Application to Association Rules.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Une méthode d'apprentissage par optimisation multicritère pour le rangement de motifs en fouille de données.

[BibT_eX]

[DOI]

Proceedings of the Extraction et Gestion des Connaissances, 2022

2020

Variable neighborhood search for graphical model energy minimization.

[BibT_eX]

[DOI]

Artif. Intell., 2020

A Relaxation-Based Approach for Mining Diverse Closed Patterns.

[BibT_eX]

[DOI]

Abdelkader Ouali

Albrecht Zimmermann

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

Exploitation des techniques de fouille de données pour la compression de contraintes table.

[BibT_eX]

[DOI]

Soufia Bennai

Kamal Amroun

Proceedings of the Extraction et Gestion des Connaissances, 2020

2019

Compressing and Querying Skypattern Cubes.

[BibT_eX]

[DOI]

Proceedings of the Advances and Trends in Artificial Intelligence. From Theory to Practice, 2019

Exploiting Data Mining Techniques for Compressing Table Constraints.

[BibT_eX]

[DOI]

Soufia Bennai

Kamal Amroun

Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

A Multiple Fault Localization Approach Based on Multicriteria Analytical Hierarchy Process.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference On Artificial Intelligence Testing, 2019

2018

Interval graph mining.

[BibT_eX]

[DOI]

Amina Kemmar

Yahia Lebbah

Int. J. Data Min. Model. Manag., 2018

Equitable Conceptual Clustering Using OWA Operator.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2018

2017

Prefix-projection global constraint and top-k approach for sequential pattern mining.

[BibT_eX]

[DOI]

Constraints An Int. J., 2017

Fault localization using itemset mining under constraints.

[BibT_eX]

[DOI]

Autom. Softw. Eng., 2017

Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems.

[BibT_eX]

[DOI]

Artif. Intell., 2017

Iterative Decomposition Guided Variable Neighborhood Search for Graphical Model Energy Minimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Integer Linear Programming for Pattern Set Mining; with an Application to Tiling.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017

Multiple Fault Localization Using Constraint Programming and Pattern Mining.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

2016

Une contrainte globale pour l'extraction de motifs séquentiels.

[BibT_eX]

[DOI]

Rev. d'Intelligence Artif., 2016

A Constraint Programming Approach for Web Log Mining.

[BibT_eX]

[DOI]

Amina Kemmar

Yahia Lebbah

Int. J. Inf. Technol. Web Eng., 2016

A global constraint for closed itemset mining.

[BibT_eX]

[DOI]

CoRR, 2016

Tractability-preserving transformations of global cost functions.

[BibT_eX]

[DOI]

Thomas Schiex

Yi Wu

Artif. Intell., 2016

Efficiently Finding Conceptual Clustering Models with Integer Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

A Global Constraint for Mining Sequential Patterns with GAP Constraint.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

A Global Constraint for Closed Frequent Pattern Mining.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

Contributions à la résolution des WCSP et approches déclaratives pour la fouille de données.

[BibT_eX]

[DOI]

, 2016

2015

Soft constraints for pattern mining.

[BibT_eX]

[DOI]

J. Intell. Inf. Syst., 2015

Replicated Parallel Strategies for Decomposition Guided VNS.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Tractability and Decompositions of Global Cost Functions.

[BibT_eX]

[DOI]

Thomas Schiex

Yi Wu

CoRR, 2015

Modeling and Mining Optimal Patterns Using Dynamic CSP.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

PREFIX-PROJECTION Global Constraint for Sequential Pattern Mining.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2015

2014

Computing Skypattern Cubes Using Relaxation.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Mining Relevant Sequence Patterns with CP-Based Framework.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Cooperative Parallel Decomposition Guided VNS for Solving Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014

Une approche PPC pour la fouille de données séquentielles.

[BibT_eX]

[DOI]

Thierry Charnois

Proceedings of the 14èmes Journées Francophones Extraction et Gestion des Connaissances, 2014

Computing Skypattern Cubes.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Mining (Soft-) Skypatterns Using Dynamic CSP.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

2013

Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2013

A Constraint Programming Approach for Mining Sequential Patterns in a Sequence Database.

[BibT_eX]

[DOI]

Thierry Charnois

CoRR, 2013

Intensification/Diversification in Decomposition Guided VNS.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

Mining (Soft-) Skypatterns Using Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Management, 2013

Découverte des soft-skypatterns avec une approche PPC.

[BibT_eX]

[DOI]

Proceedings of the Extraction et gestion des connaissances (EGC'2013), Actes, 29 janvier, 2013

2012

Exploiting Separators for Guiding VNS.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2012

A constraint language for declarative pattern discovery.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Applied Computing, 2012

Constrained Clustering Using SAT.

[BibT_eX]

[DOI]

Proceedings of the Advances in Intelligent Data Analysis XI - 11th International Symposium, 2012

Complete and Incomplete Approaches for Graph Mining.

[BibT_eX]

[DOI]

Proceedings of the 4th International conference on Web and Information Technologies, 2012

Intensification/Diversification-Driven ILS for a Graph Coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

Soft Threshold Constraints for Pattern Mining.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science - 15th International Conference, 2012

Filtering Decomposable Global Cost Functions.

[BibT_eX]

[DOI]

Thomas Schiex

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Discovering Knowledge using a Constraint-based Language

[BibT_eX]

[DOI]

CoRR, 2011

Guiding VNS with Tree Decomposition.

[BibT_eX]

[DOI]

Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

A Constraint-Based Language for Declarative Pattern Discovery.

[BibT_eX]

[DOI]

Proceedings of the Data Mining Workshops (ICDMW), 2011

2010

Advanced generic neighborhood heuristics for VNS.

[BibT_eX]

[DOI]

Nicolas Levasseur

Eng. Appl. Artif. Intell., 2010

2009

Softening Gcc and Regular with preferences.

[BibT_eX]

[DOI]

Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Solving Nurse Rostering Problems Using Soft Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

Combining VNS with constraint programming for solving anytime optimization problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems.

[BibT_eX]

[DOI]

Nicolas Levasseur

Proceedings of the Hybrid Metaheuristics, 5th International Workshop, 2008

2007

All Different: Softening AllDifferent in Weighted CSPs.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

A Value Ordering Heuristic for Weighted CSP.

[BibT_eX]

[DOI]

Nicolas Levasseur

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

2006

On-line resources allocation for ATM networks with rerouting.

[BibT_eX]

[DOI]

Philippe David

Comput. Oper. Res., 2006

2003

Réservation en ligne avec reroutage de demandes de connexion dans les réseaux ATM.

[BibT_eX]

[DOI]

Philippe David

Tech. Sci. Informatiques, 2003

Solving Constraint Optimization Problems in Anytime Contexts.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-03, 2003

2001

A New Hybrid Method for Solving Constraint Optimization Problems in Anytime Contexts.

[BibT_eX]

[DOI]