Quantization-based clustering algorithm
From MaRDI portal
Publication:975175
DOI10.1016/J.PATCOG.2010.02.020zbMATH Open1213.68557OpenAlexW2086178513MaRDI QIDQ975175FDOQ975175
Publication date: 8 June 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.02.020
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
- GAPS: A clustering method using a new point symmetry-based distance measure
- Least squares quantization in PCM
- Title not available (Why is that?)
- A central limit theorem for k-means clustering
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- On approximate geometric \(k\)-clustering
- Improvement of the \(k\)-means clustering filtering algorithm
- Faster and more robust point symmetry-based K-means algorithm
- A fast \(k\)-means clustering algorithm using cluster center displacement
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
Uses Software
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)