Recommendations
- An efficient enhanced \(k\)-means clustering algorithm
- The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
- An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
- Quantile-based clustering
Cites work
- A central limit theorem for k-means clustering
- A fast k-means clustering algorithm using cluster center displacement
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
- Faster and more robust point symmetry-based K-means algorithm
- GAPS: A clustering method using a new point symmetry-based distance measure
- scientific article; zbMATH DE number 1305524 (Why is no real title available?)
- scientific article; zbMATH DE number 2088093 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Improvement of the k-means clustering filtering algorithm
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Least squares quantization in PCM
- On approximate geometric \(k\)-clustering
This page was built for publication: Quantization-based clustering algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975175)