ANN算法總結

• kd-tree

  kd-tree works poorly in high dimensions (k<30) 本身實驗的時候差很少20到30左右吧，超過以後，就真的很慢了

• faiss

  support high-dimensional vectors of 50 to 1000+ dimensions use gpu

   

• annoy

  Works better if you don't have too many dimensions (like <100) but seems to perform surprisingly well even up to 1,000 dimensions