DocumentCode
167321
Title
Using associators to generate ensemble biclustering from multiple evolved biclusterings
Author
Eun-Youn Kim ; Ashlock, Daniel
Author_Institution
Korean Res. Inst. for Biosci. & Biotechnol., Daejeon, South Korea
fYear
2014
fDate
21-24 May 2014
Firstpage
1
Lastpage
8
Abstract
Biclustering is a data mining technique that performs clustering of the rows and columns of a matrix simultaneously. An associator is a numerical measure of how closely associated two objects should be. Ensemble methods integrate information from multiple solutions to generate superior solutions. A simple evolutionary algorithm to quickly locate multiple biclusterings of synthetic test data. The good submatrices of these biclusterings are then used as associators. Associators are accumulated across many runs of the evolutionary algorithm to create a master association matrix. This matrix is then used, via simultaneous hierarchical clustering, to create a final ensemble biclustering. Results are presenting on tuning the evolutionary algorithm as well as for the overall biclustering algorithm. The algorithm correctly locates planted clusters in the data, providing proof of concept for the ensemble technique. The technique is modular with the evolutionary algorithm, fitness function, and ensemble integration technique all easily swapped for other techniques.
Keywords
bioinformatics; data mining; evolutionary computation; numerical analysis; data mining; ensemble biclustering; ensemble integration technique; master association matrix; multiple evolved biclusterings; numerical analysis; simultaneous hierarchical clustering; Clustering algorithms; Data mining; Evolutionary computation; Robustness; Sociology; Standards; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence in Bioinformatics and Computational Biology, 2014 IEEE Conference on
Conference_Location
Honolulu, HI
Type
conf
DOI
10.1109/CIBCB.2014.6845530
Filename
6845530
Link To Document