Ensemble clustering using semidefinite programming with applications

doi:10.1007/s10994-009-5158-y

Ensemble clustering using semidefinite programming with applications

2009-12-22

51

OA

AI

V

Vikas Pratap Singh

L

Lopamudra Mukherjee *

DOI：10.1007/s10994-009-5158-y

Original

Original request for help

Save

Abstract

En 中文

In this paper, we study the ensemble clustering problem, where the input is in the form of multiple clustering solutions. The goal of ensemble clustering algorithms is to aggregate the solutions into one solution that maximizes the agreement in the input ensemble. We obtain several new results for this problem. Specifically, we show that the notion of agreement under such circumstances can be better captured using a 2D string encoding rather than a voting strategy, which is common among existing approaches. Our optimization proceeds by first constructing a non-linear objective function which is then transformed into a 0-1 Semidefinite program (SDP) using novel convexification techniques. This model can be subsequently relaxed to a polynomial time solvable SDP. In addition to the theoretical contributions, our experimental results on standard machine learning and synthetic datasets show that this approach leads to improvements not only in terms of the proposed agreement measure but also the existing agreement measures based on voting strategies. In addition, we identify several new application scenarios for this problem. These include combining multiple image segmentations and generating tissue maps from multiple-channel Diffusion Tensor brain images to identify the underlying structure of the brain.

Keywords:

Ensemble clustering

Semidefinite programming

Cluster ensembles

Segmentation aggregation

Ensemble clustering using semidefinite programming with applications

Abstract

Journal

Organization