Hybrid metaheuristic for multi-objective ...
Type de document :
Communication dans un congrès avec actes
Titre :
Hybrid metaheuristic for multi-objective biclustering in microarray data
Auteur(s) :
Seridi, Khedidja [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Jourdan, Laetitia [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Jourdan, Laetitia [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Titre de la manifestation scientifique :
CIBCB 2012 - IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology
Ville :
San Diego
Pays :
Etats-Unis d'Amérique
Date de début de la manifestation scientifique :
2012-05-09
Titre de l’ouvrage :
Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 2012 IEEE Symposium on
Éditeur :
IEEE
Date de publication :
2012-06
Discipline(s) HAL :
Sciences du Vivant [q-bio]/Bio-Informatique, Biologie Systémique [q-bio.QM]
Résumé en anglais : [en]
Biclustering is a well-known data mining problem in the field of gene expression data. It consists in extracting genes that behave similarly under some experimental conditions. As the Biclustering problem is NP-Complete ...
Lire la suite >Biclustering is a well-known data mining problem in the field of gene expression data. It consists in extracting genes that behave similarly under some experimental conditions. As the Biclustering problem is NP-Complete in most of its variants, many heuristics and metaheuristics are defined to solve for it. Classical algorithms allow the extraction of some biclusters in reasonable time, however most of them remain time consuming. In this work, we propose a new hybrid multi-objective meta-heuristic H-MOBI based on NSGA-II (Non-dominated Sorting Genetic Algorithm II), CC (Cheng and Church) heuristic and a multi-objective local search PLS-1 (Pareto Local Search 1). Experimental results on real data sets show that our approach can find significant biclusters of high quality.Lire moins >
Lire la suite >Biclustering is a well-known data mining problem in the field of gene expression data. It consists in extracting genes that behave similarly under some experimental conditions. As the Biclustering problem is NP-Complete in most of its variants, many heuristics and metaheuristics are defined to solve for it. Classical algorithms allow the extraction of some biclusters in reasonable time, however most of them remain time consuming. In this work, we propose a new hybrid multi-objective meta-heuristic H-MOBI based on NSGA-II (Non-dominated Sorting Genetic Algorithm II), CC (Cheng and Church) heuristic and a multi-objective local search PLS-1 (Pareto Local Search 1). Experimental results on real data sets show that our approach can find significant biclusters of high quality.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :