A Memetic Heuristic for the Co-clustering Problem
Mohammad Khoshneshin, Mahtab Ghazizadeh, W. Nick Street, Jeffrey W. Ohlmann · 2015
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 resul