.png){kind=icon}
Return
Ensemble methods for biclustering tasks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2012.04.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Several biclustering algorithms have been proposed in different fields of microarray data analysis. We present a new approach that improves their performance in using the ensemble methods. An ensemble biclustering is considered and formalized by a problem of binary triclustering. We propose a simple and efficient algorithm to solve it. To illustrate the interest of our ensemble approach, numerical experiments are performed on both artificial and real datasets with two biclustering algorithms commonly used in bioinformatics. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Co-clustering
Ensemble methods
Microarray data
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveA Concise Catalytic Route to the Marine Sesquiterpenoids (–)‐Clavukerin A and (–)‐Isoclavukerin A
PREAI
ShareSaveShareSave
View more