Skip to content
image post
White papers

Local search approach for the pairwise constrained clustering problem

April 16, 2024

Share with:


Authors: Tran Khanh Hiep, Nguyen Minh Duc, Bui Quoc Trung

Abstract: The pairwise constrained clustering is the problem of partitioning a set of data points into clusters when we know in advance that some pairs of points should be in the same cluster and some pairs should not. Previous studies on this problem can be divided into three categories: modifying a traditional clustering algorithm to incorporate constraints, learning a distance measure or combining both approaches. Local search is a heuristic method for finding high-quality solutions for hard optimization problems in a reasonable computation time. It has been applied to the traditional clustering problem in many studies. However, it has never been used for the pairwise constrained clustering problem. Therefore, this paper proposes Tabu search algorithms for this problem, which were tested on several datasets. The experimental results show that these algorithms are very interesting in comparison with some state-of-the-art algorithms, COP K-means, MPC K-means and LCVQE.

Download now

Do you need a workthrough of our platform? Let us know

    Related Posts

    Get ahead with AI-powered technology updates!

    Subscribe now to our newsletter for exclusive insights, expert analysis, and cutting-edge developments delivered straight to your inbox!