Fast clustering algorithms for vector quantization
- 31 March 1996
- journal article
- Published by Elsevier BV in Pattern Recognition
- Vol. 29 (3), 511-518
- https://doi.org/10.1016/0031-3203(94)00091-3
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- An improved method for finding nearest neighborsPattern Recognition Letters, 1993
- An efficient branch-and-bound nearest neighbour classifierPattern Recognition Letters, 1988
- An algorithm for finding nearest neighbours in (approximately) constant average timePattern Recognition Letters, 1986
- An improved branch and bound algorithm for computing k-nearest neighborsPattern Recognition Letters, 1985
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975