\(K\)-harmonic means data clustering with simulated annealing heuristic
From MaRDI portal
Publication:879469
DOI10.1016/j.amc.2006.05.166zbMath1114.65009MaRDI QIDQ879469
Publication date: 14 May 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.166
62H30: Classification and discrimination; cluster analysis (statistical aspects)
Related Items
Clustering of high throughput gene expression data, An algebraic multigrid-based algorithm for circuit clustering, Fast global \(k\)-means clustering based on local geometrical information, Sequence spaces \(M(\phi)\) and \(N(\phi)\) with application in clustering, A clustering approach using cooperative artificial bee colony algorithm, Variable neighborhood search for harmonic means clustering, Automatic clustering using genetic algorithms, A tabu search approach for the minimum sum-of-squares clustering problem, A novel sequence space related to \(\mathcal{L}_{p}\) defined by Orlicz function with application in pattern recognition, Candidate groups search for K-harmonic means data clustering, Application of honey-bee mating optimization algorithm on clustering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Randomised local search algorithm for the clustering problem
- Initialization insensitive LVQ algorithm based on cost-function adaptation
- The complexity of the generalized Lloyd - Max problem (Corresp.)
- Stochastic K-means algorithm for vector quantization
- Equation of State Calculations by Fast Computing Machines
- Letter to the Editor—A Monte Carlo Method for the Approximate Solution of Certain Types of Constrained Optimization Problems
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Vector quantization based on genetic simulated annealing
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters