title: How to implement DBSCAN clustering algorithm?
body: <p>I'm trying to implement <a href="http://en.wikipedia.org/wiki/DBSCAN" rel="nofollow">DBSCAN</a> but I can't understand the idea behind it. If it goes through the whole data 1 by 1 and creates a new cluster for close neighbors, then i'll always get a lot of clusters. Say it checks close neighbors of 1st point, finds enough neighbors (><code>MinPts</code>), creates a cluster for them, moves to the next point, check for neighbors (might also find neighbors that are already in a cluster) and create a new cluster for them. and so on. So some points will be added to more than 1 cluster... Thus a lot of clusters will be created.</p>
  
  <p>Can someone please explain how this algorithm works? I didn't find much information about it online.</p>