A tabu search approach for the minimum sum-of-squares clustering problem
From MaRDI portal
Publication:1031685
Recommendations
Cites work
- scientific article; zbMATH DE number 3787821 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 3617544 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A hybrid heuristic to solve a task allocation problem
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- An evolution-based tabu search approach to codebook design
- An evolutionary technique based on K-means algorithm for optimal clustering in \({\mathbb R}^{N}\)
- Application of the noising method to the travelling salesman problem
- Clustering categorical data sets using tabu search techniques
- Fuzzy Sets and Decisionmaking Approaches in Vowel and Speaker Recognition
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- Interactive Pattern Recognition: Techniques and Systems
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Knowledge‐Based Clustering
- Multidimensional data clustering utilizing hybrid search strategies
- Noising methods for a clique partitioning problem
- Optimization by simulated annealing
- Self-adaptive genetic algorithm for clustering
- Tabu search for fuzzy optimization and applications.
- The noising method: A new method for combinatorial optimization
- The noising methods: A generalization of some metaheuristics
- \(K\)-harmonic means data clustering with simulated annealing heuristic
Cited in
(22)- Clustering problems in a multiobjective framework
- Application of tabu search in classification by partition.
- Optimizando con búsqueda tabú en particionamiento sobre datos espaciales con múltiples objetivos
- \(K\)-harmonic means data clustering with tabu-search method
- A new heuristic approach for non-convex optimization problems
- A scatter search approach for the minimum sum-of-squares clustering problem
- scientific article; zbMATH DE number 2030320 (Why is no real title available?)
- A K-medoids clustering algorithm based on improved tabu search
- A new point symmetry based fuzzy genetic clustering technique for automatic evolution of clusters
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- Robust static output feedback controller synthesis using Kharitonov's theorem and evolutionary algorithms
- K-means clustering via a nonconvex optimization approach
- GSA: A gravitational search algorithm
- Clustering by adaptive local search with multiple search operators
- Design of hybrids for the minimum sum-of-squares clustering problem
- A quantum-inspired vortex search algorithm with application to function optimization
- Clustering categorical data sets using tabu search techniques
- A \(k\)-means clustering-tabu search algorithm for collaborative logistics network resource demands design and cost analysis
- A tabu search approach to clustering
- \(K\)-means cloning: adaptive spherical \(K\)-means clustering
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
This page was built for publication: A tabu search approach for the minimum sum-of-squares clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1031685)
