Parallel Hybrid Metaheuristic for ...
Type de document :
Communication dans un congrès avec actes
DOI :
Titre :
Parallel 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 :
IPDPSW 2012 - 26th IEEE International Parallel and Distributed Processing Symposium Workshops
Ville :
Shanghai
Pays :
Chine
Date de début de la manifestation scientifique :
2012-05-21
Titre de l’ouvrage :
Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International
Éditeur :
IEEE
Date de publication :
2012
Discipline(s) HAL :
Sciences du Vivant [q-bio]/Bio-Informatique, Biologie Systémique [q-bio.QM]
Résumé en anglais : [en]
To deeper examine the gene expression data, a new data mining task is more more used: the biclustering. Biclustering consists in extracting genes that behave similarly under some experimental conditions. As the Biclustering ...
Lire la suite >To deeper examine the gene expression data, a new data mining task is more more used: the biclustering. Biclustering 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 meta-heuristics have been deisgned to solve it. Proposed algorithms in literature allow the extraction of interesting biclusters but are often time consuming. In this work, we propose a new parallel hybrid multi-objective metaheuristic based on the well known multi objective metaheuristic NSGA-II (Non-dominated Sorting Genetic Algorithm II), CC (Cheng and Church) heuristic and a multi-objective local search, PLS-1 (Pareto Local Search I). Experimental results on real data sets show that our approach can find significant biclusters of high quality. The speed-up of our algorithm is important with regard to the sequential version.Lire moins >
Lire la suite >To deeper examine the gene expression data, a new data mining task is more more used: the biclustering. Biclustering 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 meta-heuristics have been deisgned to solve it. Proposed algorithms in literature allow the extraction of interesting biclusters but are often time consuming. In this work, we propose a new parallel hybrid multi-objective metaheuristic based on the well known multi objective metaheuristic NSGA-II (Non-dominated Sorting Genetic Algorithm II), CC (Cheng and Church) heuristic and a multi-objective local search, PLS-1 (Pareto Local Search I). Experimental results on real data sets show that our approach can find significant biclusters of high quality. The speed-up of our algorithm is important with regard to the sequential version.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :