Variable neighborhood search for harmonic means clustering

Citations of this article
Mendeley users who have this article in their library.


Harmonic means clustering is a variant of minimum sum of squares clustering (which is sometimes called K-means clustering), designed to alleviate the dependance of the results on the choice of the initial solution. In the harmonic means clustering problem, the sum of harmonic averages of the distances from the data points to all cluster centroids is minimized. In this paper, we propose a variable neighborhood search heuristic for solving it. This heuristic has been tested on numerous datasets from the literature. It appears that our results compare favorably with recent ones from tabu search and simulated annealing heuristics. © 2010 Elsevier Inc.




Alguwaizani, A., Hansen, P., Mladenović, N., & Ngai, E. (2011). Variable neighborhood search for harmonic means clustering. Applied Mathematical Modelling, 35(6), 2688–2694.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free