A Framework for Minimal Clustering Modification via Constraint Programming

Abstract : Consider the situation where your favorite clustering algorithm applied to a data set returns a good clustering but there are a few undesirable properties. One adhoc way to fix this is to re-run the clustering algorithm and hope to find a better variation. Instead, we propose to not run the algorithm again but minimally modify the existing clustering to remove the undesirable properties. We formulate the minimal clustering modification problem where we are given an initial clustering produced from any algorithm. The clustering is then modified to: i) remove the undesirable properties and ii) be minimally different to the given clustering. We show the underlying feasibility sub-problem can be intractable and demonstrate the flexibility of our constraint programming formulation. We empirically validate its usefulness through experiments on social network and medical imaging data sets.
Document type :
Conference papers
Complete list of metadatas

Contributor : Thi-Bich-Hanh Dao <>
Submitted on : Tuesday, November 15, 2016 - 11:06:13 AM
Last modification on : Tuesday, August 13, 2019 - 11:32:01 AM


  • HAL Id : hal-01396915, version 1



Chia-Tung Kuo, S. S. Ravi, Thi-Bich-Hanh Dao, Christel Vrain, Ian Davidson. A Framework for Minimal Clustering Modification via Constraint Programming. the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), Feb 2017, San Francisco, United States. ⟨hal-01396915⟩



Record views