Improving Constrained Clustering with Active Query

Abstract : In this article, we address the problem of automatic constraint selection to improve the performance of constraint-based clustering algorithms. To this aim we propose a novel active learning algorithm that relies on a k-nearest neighbors graph and a new constraint utility function to generate queries to the human expert. This mechanism is paired with propagation and refinement processes that limit the number of constraint candidates and introduce a minimal diversity in the proposed constraints. Existing constraint selection heuristics are based on a random selection or on a min–max criterion and thus are either inefficient or more adapted to spherical clusters. Contrary to these approaches, our method is designed to be beneficial for all constraint-based clustering algorithms. Comparative experiments conducted on real datasets and with two distinct representative constraint-based clustering algorithms show that our approach significantly improves clustering quality while minimizing the number of human expert solicitations.
Document type :
Journal articles
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Tuesday, July 7, 2015 - 4:01:22 PM
Last modification on : Thursday, March 21, 2019 - 1:11:00 PM



Viet Vu Vu, Nicolas Labroche, Bernadette Bouchon-Meunier. Improving Constrained Clustering with Active Query. Pattern Recognition, Elsevier, 2012, 45 (4), pp.1749-1758. ⟨10.1016/j.patcog.2011.10.016⟩. ⟨hal-01172643⟩



Record views