Comparative study of mutation operators in the genetic algorithms for the k-means problem

DOI10.22190/FUMI2004091LMaRDI QIDQ5010376zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

genetic algorithmsvariable neighborhood search\(k\)-means problemcross-mutation operator

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

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

Cited in

(3)

• \(k\)-means genetic algorithms with greedy genetic operators
• Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem
• scientific article; zbMATH DE number 1754735 (Why is no real title available?)

Describes a project that uses

Uses Software

• UCI

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)