Hybrid metaheuristic for multi-objective ...
Document type :
Communication dans un congrès avec actes
Title :
Hybrid metaheuristic for multi-objective biclustering in microarray data
Author(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]
Conference title :
CIBCB 2012 - IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology
City :
San Diego
Country :
Etats-Unis d'Amérique
Start date of the conference :
2012-05-09
Book title :
Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 2012 IEEE Symposium on
Publisher :
IEEE
Publication date :
2012-06
HAL domain(s) :
Sciences du Vivant [q-bio]/Bio-Informatique, Biologie Systémique [q-bio.QM]
English abstract : [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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :