Integrating pairwise constraints into clustering algorithms: optimization-based approaches

Abstract : In this paper we introduce new models for semi-supervised clustering problem; in particular we address this problem from the representation space point of view. Given a dataset enhanced with constraints (typically must-link and cannot-link constraints) and any clustering algorithm, the proposed approach aims at learning a projection space for the dataset that satisfies not only the constraints but also the required objective of the clustering algorithm on unenhanced data. We propose a boosting framework to weight the constraints and infers successive projection spaces in such a way that algorithm performance is improved. We experiment this approach on standard UCI datasets and show the effectiveness of our algorithm.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00632952
Contributor : Jacques-Henri Sublemontier <>
Submitted on : Monday, October 17, 2011 - 10:46:37 AM
Last modification on : Thursday, January 17, 2019 - 3:06:06 PM

Identifiers

  • HAL Id : hal-00632952, version 1

Collections

Citation

Jacques-Henri Sublemontier, Lionel Martin, Guillaume Cleuziou, Matthieu Exbrayat. Integrating pairwise constraints into clustering algorithms: optimization-based approaches. OEDM 2011, Optimization based approaches for Emerging Data Mining problems, Dec 2011, Vancouver, Canada. pp._. ⟨hal-00632952⟩

Share

Metrics

Record views

132