title: Is kd-Tree an alternative to K-means clustering?
body: <p>I'm working with BOW object detection and I'm working on the encoding stage. I have seen some implementations that use <code>kd-Tree</code> in the encoding stage, but most writings suggest that <code>K-means</code> clustering is the way to go. </p>
  
  <p>What is the difference between the two? </p>