Conference Proceedings

Improved Consensus Clustering via linear programming

N Downing, PJ Stuckey, A Wirth

Conferences in Research and Practice in Information Technology Series | Published : 2010

Abstract

We consider the problem of Consensus Clustering. Given a finite set of input clusterings over some data items, a consensus clustering is a partitioning of the items which matches as closely as possible the given input clusterings. The best exact approach to tackling this problem is by modelling it as a Boolean Integer Program (BIP). Unfortunately, the size of the BIP grows cubically in the number of data items, hence this method is applicable to only small sets of items. In this paper we show how to tackle the problem progressively, leading to much improved solution times and far less memory usage than previously. For the case where approximate clusterings are acceptable, we show a number of..

View full abstract

Citation metrics