\(K\)-harmonic means data clustering with tabu-search method
From MaRDI portal
Publication:949929
DOI10.1016/j.apm.2007.03.011zbMath1145.68395OpenAlexW1965650377WikidataQ125874424 ScholiaQ125874424MaRDI QIDQ949929
Publication date: 22 October 2008
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2007.03.011
Related Items (8)
A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server ⋮ Clustering of high throughput gene expression data ⋮ An innovative flower pollination algorithm for continuous optimization problem ⋮ Variable neighborhood search for harmonic means clustering ⋮ A hybrid fuzzy K-harmonic means clustering algorithm ⋮ \(K\)-means cloning: adaptive spherical \(K\)-means clustering ⋮ Candidate groups search for K-harmonic means data clustering ⋮ Clustering video sequences by the method of harmonic \(k\)-means
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomised local search algorithm for the clustering problem
- The complexity of the generalized Lloyd - Max problem (Corresp.)
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
This page was built for publication: \(K\)-harmonic means data clustering with tabu-search method