Quantization-based clustering algorithm
From MaRDI portal
Publication:975175
DOI10.1016/j.patcog.2010.02.020zbMath1213.68557OpenAlexW2086178513MaRDI QIDQ975175
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Faster and more robust point symmetry-based K-means algorithm
- Improvement of the \(k\)-means clustering filtering algorithm
- GAPS: A clustering method using a new point symmetry-based distance measure
- A central limit theorem for k-means clustering
- On approximate geometric \(k\)-clustering
- A fast \(k\)-means clustering algorithm using cluster center displacement
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Least squares quantization in PCM
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
This page was built for publication: Quantization-based clustering algorithm