A tabu search approach for the minimum sum-of-squares clustering problem
From MaRDI portal
Publication:1031685
DOI10.1016/j.ins.2008.01.022zbMath1183.68541OpenAlexW2094861619MaRDI QIDQ1031685
Ke-Fei Chen, Mao Ye, Zhang Yi, Hong Wu, Yongguo Liu
Publication date: 30 October 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2008.01.022
Related Items (8)
GSA: A gravitational search algorithm ⋮ Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering ⋮ A quantum-inspired vortex search algorithm with application to function optimization ⋮ A new heuristic approach for non-convex optimization problems ⋮ Robust static output feedback controller synthesis using Kharitonov's theorem and evolutionary algorithms ⋮ \(K\)-means cloning: adaptive spherical \(K\)-means clustering ⋮ A new point symmetry based fuzzy genetic clustering technique for automatic evolution of clusters ⋮ K-means clustering via a nonconvex optimization approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- 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
- \(K\)-harmonic means data clustering with simulated annealing heuristic
- Multidimensional data clustering utilizing hybrid search strategies
- The noising method: A new method for combinatorial optimization
- Self-adaptive genetic algorithm for clustering
- Tabu search for fuzzy optimization and applications.
- Application of the noising method to the travelling salesman problem
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- Clustering categorical data sets using tabu search techniques
- An evolutionary technique based on K-means algorithm for optimal clustering in \({\mathbb R}^{N}\)
- A hybrid heuristic to solve a task allocation problem
- Noising methods for a clique partitioning problem
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Interactive Pattern Recognition: Techniques and Systems
- Fuzzy Sets and Decisionmaking Approaches in Vowel and Speaker Recognition
- Knowledge‐Based Clustering
- The noising methods: A generalization of some metaheuristics
This page was built for publication: A tabu search approach for the minimum sum-of-squares clustering problem
