k-means versus LSH algorithm
<p>I'm pretty new to data mining and ML. I want to understand how different is k-means from LSH. Upon reading few papers and other materials available online, it seems that both algorithms try to achieve grouping / clustering of similar documents. For usecases like spam detection, either of them have been used in many papers. But I'm not very clear how they are different and if at all we use this for a usecase like spam detection, how would the result differ at all?</p>