Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

DBSCAN: The Algorithm

  • Arbitrary select a point p
  • Retrieve all points density-reachable from p w.r.t. Eps and MinPts
  • If p is a core point, a cluster is formed
  • If p is a border point, no points are density-reachable from p and DBSCAN visits the next point of the database
  • Continue the process until all of the points have been processed
  • If a spatial index is used, the computational complexity of DBSCAN is O(nlogn), where n is the number of database objects. Otherwise, the complexity is O(n^2)

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.