k-means genetic algorithms with greedy genetic operators
Summary: The \(k\)-means problem is one of the most popular models of cluster analysis. The problem is NP-hard, and modern literature offers many competing heuristic approaches. Sometimes practical problems require obtaining such a result (albeit notExact), within the framework of the \(k\)-means model, which would be difficult to improve by known methods without a significant increase in the computation time or computational resources. In such cases, genetic algorithms with greedy agglomerative heuristic crossover operator might be a good choice. However, their computational complexity makes it difficult to use them for large-scale problems. The crossover operator which includes the \(k\)-means procedure, taking the absolute majority of the computation time, is essential for such algorithms, and other genetic operators such as mutation are usually eliminated or simplified. The importance of maintaining the population diversity, in particular, with the use of a mutation operator, is more significant with an increase in the data volume and available computing resources such as graphical processing units (GPUs). In this article, we propose a new greedy heuristic mutation operator for such algorithms and investigate the influence of new and well-known mutation operators on the objective function value achieved by the genetic algorithms for large-scale \(k\)-means problems. Our computational experiments demonstrate the ability of the new mutation operator, as well as the mechanism for organizing subpopulations, to improve the result of the algorithm.
- Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem
- Comparative study of mutation operators in the genetic algorithms for the \(k\)-means problem
- An enhanced genetic algorithm with new mutation for cluster analysis
- VNS-based algorithms for the centroid-based clustering problem
- K-means clustering analysis based on cloud adaptive genetic algorithm
- A genetic algorithm with tournament selection as a local search method
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- A new local search for continuous location problems
- A new mutation operator for real coded genetic algorithms
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
- Aggregation error for location models: Survey and analysis
- Algorithms with greedy heuristic procedures for mixture probability distribution separation
- An aggregation heuristic for large scale p-median problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An efficient genetic algorithm for the \(p\)-median problem
- An optimal method for solving the (generalized) multi-Weber problem
- Clustering stability-based evolutionary K-means
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Exact and approximate solutions to the multisource weber problem
- Finding Groups in Data
- Heuristic Methods for Location-Allocation Problems
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1975107 (Why is no real title available?)
- Introduction to Genetic Algorithms
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Least squares quantization in PCM
- New genetic algorithms based approaches to continuous \(p\)-median problem
- New heuristic algorithms for solving the planar p-median problem
- NP-hardness of Euclidean sum-of-squares clustering
- Roaming optimization: a new evolutionary technique for multimodal optimization
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Simultaneously applying multiple mutation operators in genetic algorithms
- Solution methods for thep-median problem: An annotated bibliography
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- StreamKM++, a clustering algorithm for data streams
- Sublinear time approximate clustering
- The \(p\)-median problem: a survey of metaheuristic approaches
- The complexity of the generalized Lloyd - Max problem (Corresp.)
- VNS-based algorithms for the centroid-based clustering problem
This page was built for publication: \(k\)-means genetic algorithms with greedy genetic operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217036)
