Bicluster detection by hyperplane projection and evolutionary optimization

Abstract

Copyright © 2018 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved Biclustering is a powerful unsupervised learning technique that has different applications in many fields especially in gene expression analysis. This technique tries to group rows and columns in a dataset simultaneously, which is an NP-hard problem. In this paper, a multi-objective evolutionary algorithm is proposed with a heuristic search to solve the biclustering problem. To do so, rows are projected into the column space. Projection decreases the computational cost of geometric biclustering. The heuristic search is done by sample Pearson correlation coefficient over the rows and columns of a dataset to prune unwanted rows and columns. The experimental results on both synthetic and real datasets show the effectiveness of our proposed method.