z-logo
open-access-imgOpen Access
Multiobjective optimization of co-clustering ensembles
Author(s) -
Francesco Gullo,
A.K.M. Khaled Ahsan Talukder,
Sean Luke,
Carlotta Domeniconi,
Andrea Tagarelli
Publication year - 2012
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/2330784.2331010
Subject(s) - cluster analysis , computer science , heuristics , correlation clustering , artificial intelligence , gradient descent , heuristic , data mining , cure data clustering algorithm , selection (genetic algorithm) , machine learning , mathematical optimization , mathematics , artificial neural network , operating system
Co-clustering is a machine learning task where the goal is to simultaneously develop clusters of the data and of their respective features. We address the use of co-clustering ensembles to establish a consensus co-clustering over the data. In this paper we develop a new preference-based multiobjective optimization algorithm to compete with a previous gradient ascent approach in finding optimal co-clustering ensembles. Unlike the gradient ascent algorithm, our approach once tackles the co-clustering problem with multiple heuristics, then applies the gradient ascent algorithm's joint heuristic as a preference selection procedure. We are able to significantly outperform the gradient ascent algorithm on feature clustering and on problems with smaller datasets.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom