1. how to construct a KNN graph?
常见的方法一般有三类: i. space-partitioning trees; ii. locality sensitive hashing; iii. neighbour exploring techniques.
Reference:
1. Nearest neighbor graph;
2.
K-NN graph
原文：https://www.cnblogs.com/dulun/p/12229144.html
