| Algorithm 1: DBSCAN algorithm pseudo-code |
| Input: Sample set , neighborhood parameters |
| Workflow: |
| Initializing the core object set: ; |
| forj = 1, 2……, m |
| Determine the number of samples in the -neighborhood of sample ; |
| if |
| Put sample into the core sample set: ; |
| end if |
| end for |
| Initialize the number of clusters: ; |
| Initialize the set of unaccessed samples: ; |
| while |
| Sample sets not currently being accessed:; |
| Randomly select core objects , initializing the queue ; |
| Γ = Γ; |
| While |
| Take the first sample q from the queue Q |
| if |
| Make , |
| Put all elements of into the queue Q; |
| Γ = Γ \; |
| end if |
| end while |
| k = k + 1, generate clusters ; |
|
end while Output: cluster classification ; |