Algorithm 1. DBSCAN algorithm pseudocode.

Entries: DBSCAN (M, ε, MinPts) Outputs: Class sets Initialization arbitrarily choose a point p As long as (there are still untreated points) Find all density-reachable points of p using Eps and MinPts If (p is a point of type center) a cluster is formed If not If (p is border type point and no point is reachable by density of p), the point p is considered as a noise and DBSCAN goes to the next point in the database. End