HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering

  title={HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering},
  author={Daniel Gribel and Thibaut Vidal},
  journal={Pattern Recognit.},

Figures and Tables from this paper

A New Meta-Heuristics Data Clustering Algorithm Based on Tabu Search and Adaptive Search Memory
A new meta-heuristics algorithm called (MHTSASM) is proposed in this paper for data clustering, which is based on Tabu Search and K-M and indicates the superiority of the MH TSASM algorithm compared with other multiple clustering algorithms.
A Memetic Procedure for Global Multi-Objective Optimization
The resulting algorithm, which the authors call Non-dominated Sorting Memetic Algorithm (NSMA), besides enjoying interesting theoretical properties, excels in all of the numerical tests performed on several, widely employed, test functions.
Less is more: simple algorithms for the minimum sum of squares clustering problem
It is able to demonstrate that good starting solutions combined with a simple local search get results comparable with, and sometimes even better than, more sophisticated algorithms used in the literature.
The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem
This work proposes three algorithms to create starting solutions for improvement algorithms for clustering problem and test the algorithms on 72 instances that were investigated in the literature.
A Preliminary Study on Evolutionary Clustering for Multiple Instance Learning
This paper attempts to progress in this area carrying out a first study that introduces evolutionary algorithms for solving multiple instance cluster analysis by presenting four proposals of genetic algorithms for multi-instance partitional clustering based on CHC evolutionary algorithm.
Semi-Supervised Clustering with Inaccurate Pairwise Annotations


J-MEANS: a new local search heuristic for minimum sum of squares clustering
Genetic K-means algorithm.
  • K. Krishna, M. Narasimha Murty
  • Computer Science
    IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
  • 1999
A novel hybrid genetic algorithm that finds a globally optimal partition of a given data into a specified number of clusters using a classical gradient descent algorithm used in clustering, viz.
A heuristic algorithm for solving the minimum sum-of-squares clustering problems
This paper uses an auxiliary cluster problem to generate a set of initial points and applies the modified global $$k$$k-means algorithm starting from these points to find the global solution to the clustering problems.
Self-Adaptive Genetic Algorithm for Clustering
A new self-adaptive GA is introduced that finds the parameter setup on-line during the execution of the algorithm and is able to find the most suitable combination of the available components.
Modified global k-means algorithm for minimum sum-of-squares clustering problems
A hybrid grouping genetic algorithm for bin packing
This article describes the GGA paradigm as compared to the classic Holland-style GA and the ordering GA and shows how the bin packing GGA can be enhanced with a local optimization inspired by the dominance criterion.
A Survey of Evolutionary Algorithms for Clustering
An up-to-date overview that is fully devoted to evolutionary algorithms for clustering, is not limited to any particular kind of evolutionary approach, and comprises advanced topics like multiobjective and ensemble-based evolutionary clustering.
I-k-means-+: An iterative clustering algorithm based on an enhanced version of the k-means
Fast modified global k-means algorithm for incremental cluster construction
A Tabu search approach to the clustering problem