DILS: constrained clustering through dual iterative local search. Clustering has always been a powerful tool in knowledge discovery. Traditionally unsupervised, it has received renewed attention recently as it has shown to produce better results when provided with new types of information, thus leading to a new kind of semi-supervised learning: constrained clustering. This technique is a generalization of traditional clustering that considers additional information encoded by constraints. Constraints can be given in the form of instance-level must-link and cannot-link constraints, which is the focus of this paper. We propose a new metaheuristic algorithm, the Dual Iterative Local Search, and prove its ability to produce quality results for the constrained clustering problem. We compare the results obtained by this proposal to those obtained by the state-of-the-art algorithms on 25 datasets with incremental levels of constraint-based information, supporting our conclusions with the aid of Bayesian statistical tests.
Keywords for this software
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Lai, Xiangjing; Hao, Jin-Kao; Fu, Zhang-Hua; Yue, Dong: Neighborhood decomposition-driven variable neighborhood search for capacitated clustering (2021)
- González-Almagro, Germán; Luengo, Julián; Cano, José-Ramón; García, Salvador: DILS: constrained clustering through dual iterative local search (2020)