DBSCAN: Difference between revisions
No edit summary |
No edit summary |
||
| Line 2: | Line 2: | ||
== Motivation == | == Motivation == | ||
DBSCAN is particularly effective for tasks like class identification on a spatial context. The DBSCAN algorithm can find out any arbitrary shaped cluster without getting effected by noise.<ref name="dbscanpy"/> | |||
== References == | == References == | ||
Latest revision as of 02:50, 1 April 2020
DBSCAN (Density-based spatial clustering of applications with noise), is a density-based clustering algorithm used for examining spatial data.[1]
Motivation
DBSCAN is particularly effective for tasks like class identification on a spatial context. The DBSCAN algorithm can find out any arbitrary shaped cluster without getting effected by noise.[1]