Výsledky vyhledávání - "Lucien Mousin"

A hybrid CP/MOLS approach for multi-objective imbalanced classification

Autor: Christophe Lecoutre, Laetitia Jourdan, Nicolas Szczepanski, Gilles Audemard, Nadarajen Veerapen, Lucien Mousin

Publikováno v: GECCO '21: Genetic and Evolutionary Computation Conference
GECCO '21: Genetic and Evolutionary Computation Conference, Jul 2021, Lille France, France. pp.723-731, ⟨10.1145/3449639.3459310⟩
GECCO

In the domain of partial classification, recent studies about multiobjective local search (MOLS) have led to new algorithms offering high performance, particularly when the data are imbalanced. In the presence of such data, the class distribution is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4f85cbcdd99e8ef506581af92b22a5b
https://hal.archives-ouvertes.fr/hal-03281930

Zobrazit plný text záznamu

CLAHC - custom late acceptance hill climbing

Autor: Sylvain Clay, Nadarajen Veerapen, Laetitia Jourdan, Lucien Mousin

Publikováno v: GECCO Companion

The Late Acceptance Hill Climbing heuristic is a Hill Climbing algorithm that uses a record of the history of objective values of previously encountered solutions in order to decide whether to accept a new solution. Literature has shown that Late Acc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::627e02ca5c3fa2718db633bf75dc5934
https://doi.org/10.1145/3449726.3463129

Zobrazit plný text záznamu

Automatic Configuration of Multi-Thread Local Search: Preliminary Results on Bi-objective TSP

Autor: Nadarajen Veerapen, Nicolas Szczepanski, Laetitia Jourdan, Lucien Mousin

Publikováno v: ICTAI
2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)
2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI), IEEE, Nov 2020, Baltimore, United States. ⟨10.1109/ICTAI50040.2020.00187⟩

International audience; In solving combinatorial problems, the advent of multi-core machines has led to the development of new parallel methods offering higher performance as well as better solutions. However, finding the best parallel algorithm on s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a115b0b90ec7fe2afc9676e80ce5204
https://doi.org/10.1109/ictai50040.2020.00187

Zobrazit plný text záznamu

Multi-objective Automatic Algorithm Configuration for the Classification Problem of Imbalanced Data

Autor: Marie-Eléonore Kessaci, Laetitia Jourdan, Nicolas Szczepanski, Lucien Mousin, Sara Tari, Julie Jacques

Publikováno v: 2020 IEEE Congress on Evolutionary Computation (CEC)
2020 IEEE Congress on Evolutionary Computation (CEC), Jul 2020, Glasgow, United Kingdom. pp.1-8, ⟨10.1109/CEC48606.2020.9185785⟩
CEC

Classification problems can be modeled as multi-objective optimization problems. MOCA-I is a multi-objective local search designed to solve these problems, particularly when the data are imbalanced. However, this algorithm has been tuned by hand in o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5fd7c30ca623b9192fc012407407d3f
https://hal.science/hal-02935096

Zobrazit plný text záznamu

Optimisation multiobjectif pour le diagnostic de pathologies via biomarqueurs

Autor: Sara Tari, Laetitia Jourdan, Marie-Eléonore Kessaci, Julie Jacques, Lucien Mousin

Publikováno v: Congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF)
Congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Feb 2020, Montpellier, France
HAL

International audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c933d4999f107966a2c8fc6b99e990c9
https://hal.archives-ouvertes.fr/hal-02875059

Zobrazit plný text záznamu

Impact of the Discretization of VOCs for Cancer Prediction Using a Multi-Objective Algorithm

Autor: Marie-Eléonore Kessaci, Julie Jacques, Laetitia Jourdan, Sara Tari, Lucien Mousin

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030535513
LION
LION 2020-Learning and Intelligent Optimization
LION 2020-Learning and Intelligent Optimization, 2020, Athens, Greece. pp.151-157, ⟨10.1007/978-3-030-53552-0_16⟩

International audience; Volatile organic compounds (VOCs) are continuous medical data regularly studied to perform non-invasive diagnosis of diseases using machine learning tasks for example. The project PATHACOV aims to use VOCs in order to predict

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e99c05758f5144d380b7206039e5ecb7
https://doi.org/10.1007/978-3-030-53552-0_16

Zobrazit plný text záznamu

An Iterated Greedy-based Approach Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem

Autor: Lucien Mousin, Marie-Eléonore Kessaci, clarisse Dhaenens

Publikováno v: MIC 2017-12th Metaheuristics International Conference
MIC 2017-12th Metaheuristics International Conference, Jul 2017, Barcelona, Spain
HAL

International audience; The no-wait flowshop scheduling problem is a variant of the classical permutation flowshop problem , with the additional constraint that jobs have to be processed by the successive machines without waiting time. To efficiently

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::45e2f75e1819060251c5778bd7be149f
https://hal.science/hal-01579768/document

Zobrazit plný text záznamu

A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem

Autor: Clarisse Dhaenens, Marie-Eléonore Kessaci, Lucien Mousin

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319694030
LION
11th Learning and Intelligent OptimizatioN Conference
11th Learning and Intelligent OptimizatioN Conference, Jun 2017, Nizhny Novgorod, Russia
HAL

International audience; Constructive heuristics have a great interest as they manage to find in a very short time, solutions of relatively good quality. Such solutions may be used as initial solutions for metaheuristics for example. In this work, we

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d72d05c6c56335e8fb2db47e87dc9923
https://doi.org/10.1007/978-3-319-69404-7_14

Zobrazit plný text záznamu

Feature Selection using Tabu Search with Learning Memory: Learning Tabu Search

Autor: Clarisse Dhaenens, Marie-Eleonore Marmion, Laetitia Jourdan, Lucien Mousin

Publikováno v: Learning and Intelligent OptimizatioN Conference LION 10
Learning and Intelligent OptimizatioN Conference LION 10, May 2016, Ischia Island (Napoli), Italy
Lecture Notes in Computer Science ISBN: 9783319503486
LION
HAL

International audience; Feature selection in classification can be modeled as a com-binatorial optimization problem. One of the main particularities of this problem is the large amount of time that may be needed to evaluate the quality of a subset of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c218520fb1e0321d89c9b8051da8af74
https://hal.science/hal-01370396/document

Zobrazit plný text záznamu

A Comparison of Decoding Strategies for the 0/1 Multi-objective Unit Commitment Problem

Autor: Igor Machado, El-Ghazali Talbi, Sophie Jacquin, Lucien Mousin, Laetitia Jourdan

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319159331
EMO (1)

In the single objective Unit Commitment Problem (UCP) the problem is usually separated in two sub-problems : the commitment problem which aims to fix the on/off scheduling of each unit and the dispatching problem which goal is to schedule the product

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b3cfd2c2cd5e9c5da3e9dc67c1705214
https://doi.org/10.1007/978-3-319-15934-8_26

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání