A Memetic Heuristic for the Co-clustering Problem

Co-clustering partitions two different kinds of objects simultaneously. Bregman co-clustering is a well-studied fast iterative algorithm to perform co-clustering. However, this method is very prone to local optima. We propose a memetic algorithm to solve the co-clustering problem. Experimental results show that this method outperforms the multi-start Bregman co-clustering in both accuracy and time.

[1]  Eckart Zitzler,et al.  An EA framework for biclustering of gene expression data , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[2]  Manfred K. Warmuth,et al.  Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions , 1999, Machine Learning.

[3]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

[4]  Hitashyam Maka,et al.  Biclustering of Gene Expression Data Using Genetic Algorithm , 2005, 2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology.

[5]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[6]  Srujana Merugu,et al.  A scalable collaborative filtering framework based on co-clustering , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[7]  William Nick Street,et al.  Incremental collaborative filtering via evolutionary co-clustering , 2010, RecSys '10.

[8]  Andreas Zell,et al.  A memetic co-clustering algorithm for gene expression profiles and biological annotation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[9]  Inderjit S. Dhillon,et al.  A generalized maximum entropy approach to bregman co-clustering and matrix approximation , 2004, J. Mach. Learn. Res..

[10]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[11]  Sushmita Mitra,et al.  Evolutionary biclustering of gene expressions , 2006, UBIQ.