\(k\)-means genetic algorithms with greedy genetic operators

DOI10.1155/2020/8839763zbMath1459.62114OpenAlexW3106856472MaRDI QIDQ2217036

Guzel Shkaberina, Viktor Orlov, Lev A. Kazakovtsev, Ivan Rozhnov

Publication date: 18 December 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/8839763

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• J-MEANS
• Silhouettes
• k-means++
• StreamKM++
• clusfind
• FGKA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New heuristic algorithms for solving the planar \(p\)-median problem
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
• New genetic algorithms based approaches to continuous \(p\)-median problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
• A new mutation operator for real coded genetic algorithms
• NP-hardness of Euclidean sum-of-squares clustering
• Aggregation error for location models: Survey and analysis
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• An optimal method for solving the (generalized) multi-Weber problem
• An efficient genetic algorithm for the \(p\)-median problem
• An aggregation heuristic for large scale p-median problem
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
• Clustering stability-based evolutionary K-means
• A new local search for continuous location problems
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
• Algorithms with greedy heuristic procedures for mixture probability distribution separation
• VNS-BASED ALGORITHMS FOR THE CENTROID-BASED CLUSTERING PROBLEM
• Solution methods for thep-median problem: An annotated bibliography
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• The complexity of the generalized Lloyd - Max problem (Corresp.)
• Finding Groups in Data
• Heuristic Methods for Location-Allocation Problems
• Least squares quantization in PCM
• A genetic algorithm with tournament selection as a local search method
• Introduction to Genetic Algorithms
• StreamKM++
• Exact and approximate solutions to the multisource weber problem
• Simultaneously applying multiple mutation operators in genetic algorithms
• J-MEANS: A new local search heuristic for minimum sum of squares clustering