K-harmonic means data clustering with tabu-search method
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1692444 (Why is no real title available?)
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2012432 (Why is no real title available?)
- scientific article; zbMATH DE number 2042280 (Why is no real title available?)
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Randomised local search algorithm for the clustering problem
- The complexity of the generalized Lloyd - Max problem (Corresp.)
Cited in
(12)- Clustering video sequences by the method of harmonic \(k\)-means
- New heuristic for harmonic means clustering
- Variable neighborhood search for harmonic means clustering
- scientific article; zbMATH DE number 1692444 (Why is no real title available?)
- 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
- Candidate groups search for K-harmonic means data clustering
- Clustering of high throughput gene expression data
- K-means cloning: adaptive spherical K-means clustering
- \(K\)-harmonic means data clustering with simulated annealing heuristic
- An innovative flower pollination algorithm for continuous optimization problem
- A hybrid fuzzy K-harmonic means clustering algorithm
- Some Notes on K-Harmonic Means Clustering Algorithm
This page was built for publication: \(K\)-harmonic means data clustering with tabu-search method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949929)