Abstract
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. (C) 2010 Elsevier Inc. All rights reserved.