Retired

This document has been retired.

---

Ke Yang

Papers

• An Investigation of Practical Approximate Nearest Neighbor Algorithms (2004)
  How to use variations on classic exact data structures for nearest neighbor, if you want to get faster answers and are prepared to accept approximation?
• The IOC algorithm: Efficient Many-Class Non-parametric Classification for High-Dimensional Data (2004)
  Performing k-nearest-neghbor classifications on multi-class problems without actually finding the k-nearest neighbors.