Comparative study of mutation operators in the genetic algorithms for the k-means problem
DOI10.22190/FUMI2004091LzbMATH Open1488.90240OpenAlexW3128507056MaRDI QIDQ5010376FDOQ5010376
Authors: Rui Li, Lev A. Kazakovtsev
Publication date: 25 August 2021
Published in: Facta Universitatis, Series: Mathematics and Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22190/fumi2004091l
Recommendations
- Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem
- \(k\)-means genetic algorithms with greedy genetic operators
- An enhanced genetic algorithm with new mutation for cluster analysis
- A genetic approach to the automatic clustering problem
- \(K\)-means clustering analysis based on cloud adaptive genetic algorithm
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)
Cited In (3)
Uses Software
This page was built for publication: Comparative study of mutation operators in the genetic algorithms for the \(k\)-means problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5010376)