GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS
From MaRDI portal
Publication:3634189
DOI10.1142/S0129054109006619zbMath1178.68399MaRDI QIDQ3634189
Chao Wang, Danny Z. Chen, Mark A. Healy, Bin Xu
Publication date: 23 June 2009
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054109006619
68T05: Learning and adaptive systems in artificial intelligence
68T10: Pattern recognition, speech recognition
92C50: Medical applications (general)
Cites Work
- Geometric applications of a matrix-searching algorithm
- Improved complexity bounds for location problems on the real line
- How fast is the \(k\)-means method?
- Optimal quantization by matrix searching
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Quantization
- Least squares quantization in PCM