Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem

DOI10.1007/978-3-030-58657-7_28zbMath1460.90151OpenAlexW3086223588MaRDI QIDQ4965125

Vladimir L. Kazakovtsev, Guzel Shkaberina, Lev A. Kazakovtsev, Rui Li, Ivan Rozhnov

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_28

zbMATH Keywords

clusteringgenetic algorithm\(k\)-meansgreedy agglomerative procedure

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• Silhouettes
• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• New genetic algorithms based approaches to continuous \(p\)-median problem
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• An efficient genetic algorithm for the \(p\)-median problem
• Clustering stability-based evolutionary K-means
• A new local search for continuous location problems
• Algorithms with greedy heuristic procedures for mixture probability distribution separation
• Least squares quantization in PCM
• A genetic algorithm with tournament selection as a local search method

This page was built for publication: Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem