A Voronoi diagram based adaptive k-means-type clustering algorithm for multidimensional weighted data
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 265-275
- https://doi.org/10.1007/3-540-54891-2_20
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problemsACM Transactions on Mathematical Software, 1990
- An algorithm for multidimensional data clusteringACM Transactions on Mathematical Software, 1988
- Computational GeometryPublished by Springer Nature ,1985
- Color image quantization for frame buffer displayACM SIGGRAPH Computer Graphics, 1982
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Constructing optimal binary decision trees is NP-completeInformation Processing Letters, 1976