.png){kind=icon}
Return
Using multiobjective optimization for biclustering microarray data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2015.03.060.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Microarray data analysis is a challenging problem in the data mining field. Actually, it represents the expression levels of thousands of genes under several conditions. The analysis of this data consists on discovering genes that share similar expression patterns across a sub-set of conditions. In fact, the extracted informations are submatrices of the microarray data that satisfy a coherence constraint. These submatrices are called biclusters, while the process of extracting them is called biclustering. Since its first application to the analysis of microarray [1], many modeling and algorithms have been proposed to solve it. In this work, we propose a new multiobjective model and a new metaheuristic HMOBIibea for the biclustering problem. Results of the proposed method are compared to those of other existing algorithms and the biological relevance of the extracted information is validated. The experimental results show that our method extracts very relevant biclusters, with large sizes with respect to existing methods. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Biclustering problem
Gene expression data
Evolutionary algorithm
Multiobjective combinatorial optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSaveA biclustering algorithm based on a Bicluster Enumeration Tree: application to DNA microarray data.png)
BIODATA MINING
OAAI
BIODATA MININGIF6.1
OAAIShareSaveShareSave
View more