Co-clustering optimization using Artificial Bee Colony (ABC) algorithm

Abstract

This paper presents an Artificial Bee Colony (ABC) optimization based algorithm for co-clustering of high-dimensional data. The ABC algorithm is used for optimization problems including data clustering. We incorporate aspects of co-clustering by embedding it into the objective function used for clustering by the ABC algorithm. Instead of a linear metric, such as the Euclidean distance, we propose the use of higher order correlations to build similarity between rows and columns, each based on the other. This measure uses co-evolving similarities which when embedded into the objective function results in optimizing the co-clusters. The search space is also explored in the vicinity of the solutions produced by the ABC algorithm using three local search methods — the first is a heuristic based on computing the cluster means; the second uses the analytical gradient of the objective with respect to a centroid to find lower cost solutions in the vicinity; and, the third is a hybrid of the first two methods. Numerical experiments show significant improvement in the search for optimal clustering by incorporating new similarity metric and optimized local search method. Finally, the algorithm is shown to be highly scalable for parallel architectures for both distributed and shared memory systems. Theoretically, the best iso-efficiency function of Θ (p log p) for fully connected network with p processors is also computed for the parallel algorithm.