## Time per iteration is dominated by the partitioning step, which is m nearest neighbor searches where m is the training set size.

- Average time per iteration O(m log n) assuming d is small.

## Training set size.

- Training set should be at least 20 training vectors per code word to get reasonable performance.
- To small a training set results in “over training”.

## Number of iterations can be large.

Previous slide | Next slide | Back to first slide | View graphic version |